Hadwiger’s Conjecture

DOI10.1007/978-3-319-32162-2_13zbMath1347.05079OpenAlexW2504259738MaRDI QIDQ2827298

P. D. Seymour

Publication date: 18 October 2016

Published in: Open Problems in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32162-2_13

zbMATH Keywords

Tutte's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (32)

Improved bound for improper colourings of graphs with no odd clique minor ⋮ Improved lower bound for the list chromatic number of graphs with no K_t minor ⋮ Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ Some remarks on even-hole-free graphs ⋮ Coloring graphs with forbidden minors ⋮ Clustered variants of Hajós' conjecture ⋮ Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Complete directed minors and chromatic number ⋮ Clique minors in graphs with a forbidden subgraph ⋮ Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ Recent progress towards Hadwiger's conjecture ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ Properties of 8-contraction-critical graphs with no \(K_7\) minor ⋮ Rooted complete minors in line graphs with a Kempe coloring ⋮ The extremal function for Petersen minors ⋮ The extremal function and Colin de Verdière graph parameter ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ On the Hadwiger number of Kneser graphs and their random subgraphs ⋮ Hadwiger's conjecture for 3-arc graphs ⋮ Maximal ambiguously \(k\)-colorable graphs ⋮ Improper colouring of graphs with no odd clique minor ⋮ Notes on tree- and path-chromatic number ⋮ A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two ⋮ Odd Hadwiger for line-graphs ⋮ Connectivity and choosability of graphs with no \(K_t\) minor ⋮ Extremal functions for sparse minors ⋮ Average degree conditions forcing a minor

Cites Work

• Unnamed Item
• Unnamed Item
• A minimum degree condition forcing complete graph immersion
• The edge-density for \(K_{2,t}\) minors
• Large minors in graphs with given independence number
• Disproof of the list Hadwiger conjecture
• List colourings of planar graphs
• Forcing unbalanced complete bipartite minors
• Dense graphs have \(K_{3,t}\) minors
• Contractibility and the Hadwiger conjecture
• Lower bound of the Hadwiger number of graphs by their average degree
• Clique minors in claw-free graphs
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• A relaxed Hadwiger's conjecture for list colorings
• Some remarks on the odd Hadwiger's conjecture
• On tree-partition-width
• Linear connectivity forces large complete bipartite minors
• Note on coloring graphs without odd-\(K_k\)-minors
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• Hadwiger's conjecture is true for almost every graph
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
• Classes of chromatically unique or equivalent graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Every planar graph is 5-choosable
• Partitioning into graphs with only small components
• The extremal function for unbalanced bipartite minors
• Graph minors. XVI: Excluding a non-planar graph
• Fractional colouring and Hadwiger's conjecture
• Excluding any graph as a minor allows a low tree-width 2-coloring
• On the conjecture of Hajos
• Surfaces, tree-width, clique-minors, and partitions
• The extremal function for complete minors
• Hadwiger's conjecture for line graphs
• The extremal function for noncomplete minors
• Packing seagulls
• Topology of series-parallel networks
• Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
• Fractional coloring and the odd Hadwiger's conjecture
• The extremal function for \(K_{9}\) minors
• On the odd-minor variant of Hadwiger's conjecture
• Homomorphiesätze für Graphen
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Beweis einer Abschwächung der Hadwiger-Vermutung
• Complete Minors and Independence Number
• Immersing small complete graphs
• An extremal function for contractions of graphs
• A Relative of Hadwiger's Conjecture
• An approximate version of Hadwiger's conjecture for claw-free graphs
• A Weakening of the Odd Hadwiger's Conjecture
• Excluding Subdivisions of Infinite Cliques
• On colouring random graphs
• Contractions to k₈
• Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs
• Minors in Graphs with High Chromatic Number
• Forcing a sparse minor
• On the algebraic theory of graph colorings
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Spanning trees with many leaves
• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs

This page was built for publication: Hadwiger’s Conjecture