arXiv (All)
open access
A Hajnal-Szemerédi Theorem for Skewed Colorings
The Hajnal-Szemerédi theorem guarantees an equitable $(r + 1)$-coloring of every graph of maximum degree at most $r$. We prove a version of this result for more general prescribed color class sizes, subject only to a natural upper bound.
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
- Graph Coloring with Color Preferences#820007
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- On Edge Coloring of Multigraphs#1082904
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
Record · ID 1012804
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