Metraipolis › archive › dc_44251bc61d3e

Two Relaxations of the Dominating Hadwiger's Conjecture — arXiv:2608.12126

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12126
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:47.820Z
SHA-256 of the archived text
f24ad309e331fe7da828e620e9f4015e98fc51a696bf5045447bb3a52385f8aa
Stable URL of this page
https://metraipolis.com/documento/dc_44251bc61d3e

How to cite

Two Relaxations of the Dominating Hadwiger's Conjecture — arXiv:2608.12126 — arXiv (en), https://arxiv.org/abs/2608.12126 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44251bc61d3e (Metraipolis archive dc_44251bc61d3e, sha256 f24ad309e331fe7da828e620e9f4015e98fc51a696bf5045447bb3a52385f8aa)
BibTeX
@misc{dc44251bc61d3e,
  title = {Two Relaxations of the Dominating Hadwiger's Conjecture — arXiv:2608.12126},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12126},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44251bc61d3e; sha256 f24ad309e331fe7da828e620e9f4015e98fc51a696bf5045447bb3a52385f8aa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12126. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Illingworth and Wood recently proposed the Dominating Hadwiger's Conjecture, a strengthening of Hadwiger's Conjecture which asserts that every graph with no dominating $K_t$-model is $(t-1)$-colorable. We prove two relaxations of this conjecture. First, we show that every graph with average degree $Ct (\log t)^2$ contains a dominating $K_t$-model for some absolute constant $C$. This bound improves on the $2^{t-2}$ due to Illingworth and Wood and is within an $O(\log t)$ factor from optimal. Second, we prove that the vertices of every graph with no dominating $K_t$-model can be partitioned into $t-1$ parts such that the subgraph induced by each part has bounded maximum degree.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.12126 — 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-10-19T05:40:33.661Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).