Every graph with no $K_7^{\vee}$-minor is $6$-colorable
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913926632964096 |
|---|---|
| author | Norin, Sergey Totschnig, Agnes |
| author_facet | Norin, Sergey Totschnig, Agnes |
| contents | Let $K_7^{\vee}$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that every graph with no $K_7^{\vee}$-minor is $6$-colorable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_03244 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Every graph with no $K_7^{\vee}$-minor is $6$-colorable Norin, Sergey Totschnig, Agnes Combinatorics Let $K_7^{\vee}$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that every graph with no $K_7^{\vee}$-minor is $6$-colorable. |
| title | Every graph with no $K_7^{\vee}$-minor is $6$-colorable |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.03244 |