arXiv (All)
open access
Burling graphs in graphs with large chromatic number
A graph class is $χ$-bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersection graphs of straight-line segments in the plane are $χ$-bounded, but this was disproved by Pawlik et al. (2014), who sho
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
- An Independent Border-Free Type-A Cover of Q221 and Improved Asymptotic Bounds for Queen Domination#821546
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#920733
- On $k$-limited domination: complexity and Cartesian products#1156397
- Polychromatic 2-colorings with Bounded Discrepancy for Triangulations#1106273
Record · ID 1357052
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