On the conjecture of Hajos
From MaRDI portal
Publication:1835686
DOI10.1007/BF02579269zbMath0504.05052OpenAlexW2034615466WikidataQ105709214 ScholiaQ105709214MaRDI QIDQ1835686
Paul Erdős, Siemion Fajtlowicz
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579269
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items (26)
Coloring immersion-free graphs ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Topological cliques of random graphs ⋮ Clustered variants of Hajós' conjecture ⋮ Topological Cliques in Graphs ⋮ 4‐Separations in Hajós graphs ⋮ Remarks on a conjecture of Barát and Tóth ⋮ Packing topological minors half‐integrally ⋮ Topological minors in graphs of large girth ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Hadwiger's conjecture is true for almost every graph ⋮ Topological cliques in graphs II ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Hajós' conjecture and cycle power graphs ⋮ Some remarks on Hajós' conjecture ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ On a coloring conjecture of Hajós ⋮ Graphs Containing TopologicalH ⋮ Hadwiger’s Conjecture ⋮ The order of the largest complete minor in a random graph ⋮ Dichromatic number and forced subdivisions ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Rooted topological minors on four vertices ⋮ Immersion and clustered coloring ⋮ Unnamed Item ⋮ Independence, clique size and maximum degree
Cites Work
This page was built for publication: On the conjecture of Hajos
