The rainbow Turán threshold conjecture for expanded cliques
Let denote the rainbow hyper-Turán number for the -uniform expansion , and let be the number of edges in the complete balanced -partite -graph on vertices. Rainbow Turán threshold conjecture. For integers , there is a constant such that, for sufficiently large , when ,
and when ,
The conjecture is motivated by the two regimes known for the graph rainbow Turán number; the intermediate range is stated to be undetermined in the source.
References
- Xiamiao Zhao, Yuanpei Wang and Junpeng Zhou, “Hypergraph extensions of the Alon–Frankl Theorem and rainbow Turán problems”, arXiv:2605.01768 (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.