Metraipolis › archive › dc_cc6eb6cb2adc
Hilton-Zhao vertex-splitting conjecture for triangle-free graphs — arXiv:2610.41984
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41984
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:00:31.405Z
- SHA-256 of the archived text
1a7140282cbe0a002abf28fcd3299fb2aa3be27bb94473d2ec633f4c0a978ee2- Stable URL of this page
https://metraipolis.com/documento/dc_cc6eb6cb2adc
How to cite
Hilton-Zhao vertex-splitting conjecture for triangle-free graphs — arXiv:2610.41984 — arXiv (en), https://arxiv.org/abs/2610.41984 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc6eb6cb2adc (Metraipolis archive dc_cc6eb6cb2adc, sha256 1a7140282cbe0a002abf28fcd3299fb2aa3be27bb94473d2ec633f4c0a978ee2)
BibTeX
@misc{dccc6eb6cb2adc,
title = {Hilton-Zhao vertex-splitting conjecture for triangle-free graphs — arXiv:2610.41984},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41984},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc6eb6cb2adc; sha256 1a7140282cbe0a002abf28fcd3299fb2aa3be27bb94473d2ec633f4c0a978ee2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41984. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Every graph obtained from a regular Class $1$ graph by a vertex-splitting is overfull and hence is of Class $2$; the central question is whether the resulting graph is edge-chromatic critical. We consider a revised version of the Hilton-Zhao vertex-splitting conjecture for triangle-free base graphs, excluding the known cubic exception that arises from the Wagner graph. Let $G$ be a connected $n$-vertex triangle-free $\Delta$-regular Class $1$ graph, and let $G^{*}$ be obtained from $G$ by splitting one vertex into two adjacent vertices. We first show that any non-extreme vertex-splitting produces a $\Delta$-critical graph provided $\Delta>\frac{n-1}{3}$. Consequently, for non-extreme vertex-splittings, the revised version of the conjecture is valid across its entire conjectured degree range, and indeed even under a slightly weaker degree condition. We next turn to arbitrary vertex-splittings, extreme ones included. It is shown that $G^*$ is $\Delta$-critical provided $n \ge 10$ and $\Delta>\frac{2n-3}{5}$. In addition, for $n>24$, the non-strict condition $\Delta \ge \frac{2n-3}{5}$ is already sufficient. This extends the bipartite range $\Delta>\frac{2n}{5}$ to the boundary range that the bipartite argument does not cover. In particular, our arguments give a complete treatment of the case of triangle-free $6$-regular base graphs in the conjectured range. The proofs bring together structural properties of full-deficiency pairs, homomorphism theorems for dense triangle-free graphs, and Hamilton decompositions built via graph detachment.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41984 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:42:45.749Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).