arXiv (All)
open access
List coloring uncrowded hypergraphs at the shattering threshold
Improving an earlier bound of Frieze and Mubayi, Iliopoulos showed that any $k$-uniform uncrowded hypergraph of maximum degree $Δ$ has list chromatic number at most $(1+o(1))(k-1)\Big(\fracΔ{\logΔ}\Big)^{\frac{1}{k-1}}$. Determining the optimal leading constant in this bound remains a major open pro
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
- A rate for the average vacancy of uniformly random matchings in linear hypergraphs#1062035
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Kalai's Conjecture for Tight Trees#985413
- Perfect Matching in Product Graphs and in their Random Subgraphs#821390
- A stronger upper bound on the D-chromatic index#822295
Record · ID 985137
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