On proper colorings of hypergraphs
Nick Gravin, Dmitrii Karpov

TL;DR
This paper establishes new upper bounds on the number of colors needed for proper vertex coloring of hypergraphs based on their maximum degree and edge size, improving understanding of coloring constraints.
Contribution
It proves that hypergraphs with certain degree and edge size conditions can be properly colored with fewer colors than previously known.
Findings
Hypergraphs with degree $ riangle$ and edge size $oldsymbol{ ext{ extdelta}}$ are colorable with $oldsymbol{k+1}$ colors.
If $ extdelta extgreater= 3$ and $k extgreater= 3$, then hypergraphs are colorable with $oldsymbol{k}$ colors.
Derived upper bounds on colors needed for dynamic colorings of hypergraphs.
Abstract
Let be a hypergraph of maximal vertex degree , such that each its hyperedge contains at least vertices. Let . We prove that (i) The hypergraph admits proper vertex coloring in colors. (ii) The hypergraph admits proper vertex coloring in colors, if and . As a consequence of these results we derive upper bounds on the number of colors in dynamic colorings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
