Frankl's product conjecture for rainbow-triangle-free graph triples
Let be graphs with a common vertex set on vertices. A rainbow triangle is a triangle whose three edges belong to three distinct graphs among . Frankl's conjecture. If the graphs have no rainbow triangle, then
The bound is attained by taking three copies of a complete bipartite graph with parts as equal as possible. Frankl proved the conjecture under the additional assumptions and , but the paper gives a counterexample in general, so the conjecture is false.
References
- Peter Frankl, Ervin Győri, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga and Xiutao Zhu, “Extremal results for graphs avoiding a rainbow subgraph”, arXiv:2204.07567 (2022).
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.