A Note on Polychromatic Colorings of Shift-Chains

Published 8 May 2024 in math.CO and cs.DM | (2405.05296v2)

Abstract: We popularize the question whether, for $m$ large enough, all $m$-uniform shift-chain hypergraphs are properly $2$-colorable. On the other hand, we show that for every $m$ some $m$-uniform shift-chains are not polychromatic $3$-colorable.

Abstract PDF HTML Upgrade to Chat

Authors (1)

Torsten Ueckerdt

References (1)

Survey on Decomposition of Multiple Coverings, pages 219–257. 2013. preprint: http://www.cs.elte.hu/~dom/cikkek/surveyfinal.pdf. doi:10.1007/978-3-642-41498-5_9.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free