The near-linear-order Hajós conjecture for critical graphs

Let GG be an rr-critical graph on r+o(r)r+o(r) vertices, where an rr-critical graph has chromatic number rr and every proper subgraph has smaller chromatic number. A graph satisfies the Hajós conjecture when it contains a subdivision of KrK_r. Near-linear-order Hajós conjecture. GG satisfies the Hajós conjecture.

The paper has established the assertion for rr-critical graphs on at most r+4r+4 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.