Repository of colleges and higher education institutions

Show document
A+ | A- | Help | SLO | ENG

Title:Degree-balanced decompositions of cubic graphs
Authors:ID Lužar, Borut (Author)
ID Przybyło, Jakub (Author)
ID Soták, Roman (Author)
Files:.pdf RAZ_Luzar_Borut_2025.pdf (586,76 KB)
MD5: A8402C71668AFEEE4271984B3F6B3C9A
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:FIŠ - Faculty of Information Studies in Novo mesto
Abstract:We show that every cubic graph on ▫$n$▫ vertices contains a spanning subgraph, in which the number of vertices of each degree deviates from ▫$\frac{n}{4}$▫ by at most ▫$\frac{1}{2}$▫, up to three exceptions. This resolves the conjecture of Alon and Wei ({\em Irregular subgraphs, Combin. Probab. Comput. 32(2) (2023), 269--283}) for cubic graphs.
Keywords:irregular subgraph, repeated degrees, degree-balanced decomposition
Publication status:Published
Publication version:Version of Record
Article acceptance date:28.08.2024
Publication date:25.04.2025
Year of publishing:2025
Number of pages:str. 1-10
Numbering:Vol. 128, art. no. ǂ104169
PID:20.500.12556/ReVIS-11692 New window
COBISS.SI-ID:236916739 New window
UDC:519.17
ISSN on article:1095-9971
DOI:10.1016/j.ejc.2025.104169 New window
Note:Naslov z nasl. zaslona; Opis vira z dne 23. 5. 2025;
Publication date in ReVIS:23.05.2025
Views:314
Downloads:1
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:European journal of combinatorics
Shortened title:Eur. j. comb.
Publisher:Academic Press
ISSN:1095-9971
COBISS.SI-ID:53351683 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0383
Name:Kompleksna omrežja

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3002
Name:Prirejanja in barvanja povezav v kubičnih grafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008
Name:Drevesno neodvisnostno število grafov

Funder:Slovak Research and Development Agency
Project number:APVV–19–0153, APVV–23–0191
Name:Embedded Graphs - Colorings and Structure

Funder:VEGA, Slovak Republic Research Grant
Project number:1/0574/21

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Po stopnjah uravnotežene dekompozicije kubičnih grafov
Abstract:Pokažemo, da vsak kubični graf z ▫$n$▫ vozlišči vsebuje vpet podgraf, v katerem število vozlišč vsake stopnje odstopa od ▫$\frac{n}{4}$▫ za največ ▫$\frac{1}{2}$▫, razen pri treh izjemah. S tem rešimo domnevo Alona in Wei ({\em Irregular subgraphs, Combin. Probab. Comput. 32(2) (2023), 269--283}) za kubične grafe.
Keywords:neregularen podgraf, ponavljajoče stopnje, po stopnjah uravnotežena dekompozicija


Back