Hadwiger's Conjecture is True for Almost Every Graph

1980/09/01 by B. Bollobás, B Bollobás, Paul A. Catlin +3 · 122 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Clique number #Combinatorics #Complexity and Algorithms in Graphs #Conjecture #Discrete mathematics #Graph #Limits and Structures in Graph Theory #Mathematics

paper · doi:10.1016/s0195-6698(80)80001-1

published in European Journal of Combinatorics 1(3), 195-199 (Elsevier BV)

crossref issued 1980/09/01 · crossref published 1980/09/01 · crossref published-print 1980/09/01 · openalex publication_date 1980/09/01 · crossref created 2013/09/09 · crossref deposited 2018/10/13 · openalex created_date 2025/10/10 · crossref indexed 2026/01/27 · openalex updated_date 2026/07/25

Citations

• Graph Theory
• On the conjecture of hajós
• Hajós' graph-coloring conjecture: Variations and counterexamples

Cited by

• Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
• Independence number in triangle-free graphs avoiding a minor
• On the extremal function for graph minors
• Graph Minors. XIX. Well-quasi-ordering on a surface
• Graph minor [wikipedia]
• Hadwiger conjecture (graph theory) [wikipedia]
• Hadwiger number [wikipedia]
• Hugo Hadwiger [wikipedia]