arXiv (OAI Expanded)
open access
Partition universality for graphs of bounded degeneracy and degree
We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also improve the upper bounds on the number of edges $G$ must hav
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
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#920733
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
- Graph Coloring with Color Preferences#820007
Record · ID 1122870
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