Hadwiger's conjecture is true for almost every graph
From MaRDI portal
Publication:1150631
DOI10.1016/S0195-6698(80)80001-1zbMath0457.05041OpenAlexW1991445030WikidataQ55934708 ScholiaQ55934708MaRDI QIDQ1150631
Paul Erdős, Paul A. Catlin, Béla Bollobás
Publication date: 1980
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(80)80001-1
Related Items (43)
Bicircular matroids are 3-colorable ⋮ Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Strong complete minors in digraphs ⋮ The extremal functions for triangle-free graphs with excluded minors ⋮ Hadwiger's conjecture for squares of 2-trees ⋮ Cliques in graphs excluding a complete graph minor ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ Independent edges in bipartite graphs obtained from orientations of graphs ⋮ Graphs without minor complete subgraphs ⋮ Hadwiger Number of Graphs with Small Chordality ⋮ Optimally reconfiguring list and correspondence colourings ⋮ A lower bound on the average degree forcing a minor ⋮ Clique minors in graphs with a forbidden subgraph ⋮ On the extremal function for graph minors ⋮ The extremal function for unbalanced bipartite minors ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Forcing a sparse minor ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ Unnamed Item ⋮ Hadwiger's conjecture for inflations of 3-chromatic graphs ⋮ Complete partitions of graphs ⋮ Subcontraction-equivalence and Hadwiger's conjecture ⋮ The extremal function and Colin de Verdière graph parameter ⋮ Forcing unbalanced complete bipartite minors ⋮ The extremal function for \(K_{9}\) minors ⋮ Some remarks on Hajós' conjecture ⋮ An extremal function for contractions of graphs ⋮ Unnamed Item ⋮ Minors in random regular graphs ⋮ Reducing graph transversals via edge contractions ⋮ Lower bounds for treewidth of product graphs ⋮ Hadwiger’s Conjecture and Squares of Chordal Graphs ⋮ Hadwiger’s Conjecture ⋮ The order of the largest complete minor in a random graph ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks ⋮ Minors in lifts of graphs ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory ⋮ On the maximum density of graphs which have no subcontraction to \(K^ r\). ⋮ The extremal function for complete minors ⋮ Connectivity and choosability of graphs with no \(K_t\) minor ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles ⋮ Achromatic numbers of random graphs ⋮ Average degree conditions forcing a minor
Cites Work
This page was built for publication: Hadwiger's conjecture is true for almost every graph
