Asymptotic product conjecture for rainbow-triangle-free graph triples
Let be the maximum on of
and suppose that the maximum is attained at . Consider three graphs on a common vertex set of size , with no rainbow triangle. The asymptotic product conjecture. One has
The paper proves a construction with product at least , showing that this is the natural asymptotic bound. Establishing the matching upper bound remains open in the source.
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.