Keszegh–Pálvölgyi linear bound conjecture for polychromatic coloring
Let be a hereditary family of hypergraphs, and let be the least integer , if it exists, such that every -heavy member of is polychromatically -colorable; set if no such exists. A hypergraph is -heavy when every edge has size at least , and a coloring is polychromatic when every edge contains a vertex of each of the colors.
Keszegh–Pálvölgyi linear bound conjecture. For every and every hereditary family ,
This is a stronger quantitative form of the finiteness conjecture and was conjectured by Keszegh and the author.
References
Status
- Refuted: Dömötör Pálvölgyi. Note on polychromatic coloring of hereditary hypergraph families (Graphs and Combinatorics, 2024) https://pmc.ncbi.nlm.nih.gov/articles/PMC11582308/
Source: Dömötör Pálvölgyi, “Note on polychromatic coloring of hereditary hypergraph families”, arXiv:2309.04603 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.