arXiv (All)
open access
Box-Delaunay graphs of large chromatic number
For every $n$, we construct a 2-dimensional $n$-element poset whose Hasse diagram has independence number $n\exp(-Ω(\sqrt{\log n}))$, and consequently, chromatic number $\exp(Ω(\sqrt{\log n}))$. This also yields an $n$-point planar set whose box-Delaunay graph satisfies the same bounds.
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
- k-Coloring is Faster than Computing the Chromatic Number#987763
- The crossing number and the unit-distance crossing number of the Hamming graphs H(d,3)=K_3^{box d}, and their realizations over many coordinate fields#1083260
- Beyond halfway to Hadwiger's conjecture#987876
- Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs#987759
- Sampling Line-Graph Colorings with Constant Extra Colors#1063651
Record · ID 821372
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