Indexed metadata
A Hajnal-Szemerédi Theorem for Skewed Colorings
Mathis Birken
Source abstract
The Hajnal-Szemerédi theorem guarantees an equitable -coloring of every graph of maximum degree at most . We prove a version of this result for more general prescribed color class sizes, subject only to a natural upper bound.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.