On the conjecture of Hajos

DOI10.1007/BF02579269zbMATH Open0504.05052OpenAlexW2034615466WikidataQ105709214 ScholiaQ105709214MaRDI QIDQ1835686FDOQ1835686

Authors: Siemion Fajtlowicz, P. Erdős 

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579269

Recommendations

• Some remarks on Hajós' conjecture
• Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
• Triangulations and the Hajós conjecture
• Hajós' conjecture for line graphs
• On a coloring conjecture of Hajós

zbMATH Keywords

chromatic numbersubdivisionlabelled graphss-chromatic graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some remarks on the theory of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The existence of unavoidable sets of geographically good configurations
• Colouring problems

Cited In (35)

• Immersion and clustered coloring
• Rooted topological minors on four vertices
• Title not available (Why is that?)
• On a conjecture raised by Yuzo Hosono
• Topological cliques in graphs II
• Graphs containing topological \(H\)
• Study on the vertex chromatic conjecture of the graph
• Reflections on graph theory
• Packing topological minors half‐integrally
• The order of the largest complete minor in a random graph
• Hadwiger's conjecture is true for almost every graph
• Hadwiger’s Conjecture
• Remarks on a conjecture of Barát and Tóth
• Title not available (Why is that?)
• Hunt's hypothesis (H) and Getoor's conjecture
• Subdivisions with congruence constraints in digraphs of large chromatic number
• Coloring immersion-free graphs
• Title not available (Why is that?)
• Topological cliques of random graphs
• Reducing Hajós' 4-coloring conjecture to 4-connected graphs
• 4‐Separations in Hajós graphs
• Topological Cliques in Graphs
• The Kelmans-Seymour conjecture. IV: A proof
• Title not available (Why is that?)
• Independence, clique size and maximum degree
• Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
• Some remarks on Hajós' conjecture
• On a coloring conjecture of Hajós
• Dichromatic number and forced subdivisions
• Hajós' conjecture for line graphs
• Clustered variants of Hajós' conjecture
• Topological minors in graphs of large girth
• Rolling backwards can move you forward: On embedding problems in sparse expanders
• Triangulations and the Hajós conjecture
• Hajós' conjecture and cycle power graphs

This page was built for publication: On the conjecture of Hajos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835686)