Towards the Albertson conjecture

zbMATH Open1188.05051arXiv0909.0413MaRDI QIDQ976729FDOQ976729

Authors: János Barát, Géza Tóth 

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Albertson conjectured that if a graph $G$ has chromatic number $r$ then its crossing number is at least as much as the crossing number of $K_r$. Albertson, Cranston, and Fox verified the conjecture for $rle12$. We prove the statement for $rle16$.

Full work available at URL: https://arxiv.org/abs/0909.0413

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On Alspach's conjecture
• On the Alspach conjecture
• A note on Alperin's conjecture
• On the conjecture of Alon-Tarsi
• Alder's conjecture
• On the Casas-Alvero conjecture
• On a generalization of Albert's theorem
• Publication:3481924
• The Alon-Tarsi conjecture: a perspective on the main results
• On a conjecture of Alon

zbMATH Keywords

chromatic numbercrossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Remarks on a conjecture of Barát and Tóth
• The Crossing Number of the Cone of a Graph
• On the Alspach conjecture
• The Crossing Number of the Cone of a Graph
• A survey of graphs with known or bounded crossing numbers

This page was built for publication: Towards the Albertson conjecture

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