arXiv (OAI Expanded)
open access
A Proof of Albertson's Conjecture
Albertson conjectured that every graph of chromatic number r has crossing number at least that of K_r. We prove the conjecture for every r. After the known case r <= 18, an r-critical counterexample is reduced to two order ranges. Near r, we use Gallai's decomposition, completion, and a reserved wea
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On reducible partition of graphs and its application to Hadwiger conjecture#821635
- The Partial List Colouring Conjecture is False#1049034
- Ramsey properties of maximal (outer)planar graphs#972204
- A Hajnal-Szemerédi Theorem for Skewed Colorings#1012804
- A Complete Proof of the Strong Conjecture about $F$-Irregular Graphs#1013843
Record · ID 1084360
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive