Conjecture on the strong chromatic extremal function of Berge paths
Let be a fixed integer. For a path with edges, let denote its Berge hypergraph, and let be the strong chromatic extremal function for -uniform hypergraphs avoiding . Path strong-coloring conjecture. There exists a function such that, whenever , we have
The case is established in the preceding theorem, while the conjecture predicts the same equality for every fixed uniformity once the path length is sufficiently large.
References
- Yichen Wang, Mengyu Duan, Dániel Gerbner and Hilal Hama Karim, “On the largest chromatic number of F-free hypergraphs”, arXiv:2604.21551 (2026).
Progress summary
Never refreshed
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.