Metraipolis › archive › dc_b44ff32427cd

Every graph with no $K_7^=$ minor is 6-colorable — arXiv:2609.17760

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17760
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:01.523Z
SHA-256 of the archived text
15c986c57ac4e3b5074d92747850fd47d40e195ba52062d289200e655b7a25dd
Stable URL of this page
https://metraipolis.com/documento/dc_b44ff32427cd

How to cite

Every graph with no $K_7^=$ minor is 6-colorable — arXiv:2609.17760 — arXiv (en), https://arxiv.org/abs/2609.17760 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b44ff32427cd (Metraipolis archive dc_b44ff32427cd, sha256 15c986c57ac4e3b5074d92747850fd47d40e195ba52062d289200e655b7a25dd)
BibTeX
@misc{dcb44ff32427cd,
  title = {Every graph with no $K_7^=$ minor is 6-colorable — arXiv:2609.17760},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17760},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b44ff32427cd; sha256 15c986c57ac4e3b5074d92747850fd47d40e195ba52062d289200e655b7a25dd},
  year = {2026}
}

Archived text

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

The first open case of Hadwiger's conjecture states that every $K_7$-minor-free graph is 6-colorable. We prove that this is the case for $K_7^=$-minor-free graphs, where $K_7^=$ denotes the graph obtained from $K_7$ by deleting two independent edges. The proof is based on an independently interesting density result: Every 5-connected $K_7^=$-minor-free graph with $n\ge 6$ vertices has at most $4n-8$ edges.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.17760 — 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-15T15:38:58.219Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).