The near-linear-order Hajós conjecture for critical graphs
The near-linear-order Hajós conjecture for critical graphs
Let be an -critical graph on vertices, where an -critical graph has chromatic number and every proper subgraph has smaller chromatic number. A graph satisfies the Hajós conjecture when it contains a subdivision of . Near-linear-order Hajós conjecture. satisfies the Hajós conjecture.
The paper has established the assertion for -critical graphs on at most vertices, and proposes extending those methods to the broader near-linear-order regime; the general statement remains open.
Sources & referencesView supporting material
Primary source
János Barát and Géza Tóth, “Towards The Albertson Conjecture”, arXiv:0909.0413 (2009).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.