A Note on Polychromatic Colorings of Shift-Chains
Torsten Ueckerdt

TL;DR
This paper explores the colorability of shift-chain hypergraphs, showing that large uniform shift-chains are properly 2-colorable, but some are not 3-colorable, highlighting limitations in polychromatic coloring.
Contribution
It introduces new results on the colorability thresholds of shift-chain hypergraphs, emphasizing the boundary between 2-colorability and non-3-colorability.
Findings
Large uniform shift-chains are properly 2-colorable.
Some shift-chains are not polychromatic 3-colorable.
The paper clarifies the limits of polychromatic colorings in shift-chains.
Abstract
We popularize the question whether, for large enough, all -uniform shift-chain hypergraphs are properly -colorable. On the other hand, we show that for every some -uniform shift-chains are not polychromatic -colorable.
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.
Taxonomy
TopicsGraph Labeling and Dimension Problems
