Short Brooms in Edge-chromatic Critical Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918266022133760 |
|---|---|
| author | Chen, Yonglei Cao, Yan |
| author_facet | Chen, Yonglei Cao, Yan |
| contents | This paper studies short brooms in edge-chromatic critical graphs. We prove that for any short broom in a $Δ$-critical graph, at most one color is missing at more than one vertex. Moreover, this color (if exists) is missing at exactly two vertices. Applying this result, we verify the Vertex-splitting Conjecture for graphs with $Δ\geq 2(n-1)/3$ and the Overfull Conjecture for $Δ$-critical graphs satisfying $Δ\geq (2n+5δ-12)/3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_07252 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Short Brooms in Edge-chromatic Critical Graphs Chen, Yonglei Cao, Yan Combinatorics This paper studies short brooms in edge-chromatic critical graphs. We prove that for any short broom in a $Δ$-critical graph, at most one color is missing at more than one vertex. Moreover, this color (if exists) is missing at exactly two vertices. Applying this result, we verify the Vertex-splitting Conjecture for graphs with $Δ\geq 2(n-1)/3$ and the Overfull Conjecture for $Δ$-critical graphs satisfying $Δ\geq (2n+5δ-12)/3$. |
| title | Short Brooms in Edge-chromatic Critical Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.07252 |