← All problems

The joint Ramsey–Turán density conjecture for (K3,K7)(K_3,K_7)

4 years old · traced to

For δ>0\delta>0, let ρ(3,7,δ)\rho(3,7,\delta) be the limiting maximum edge density of an nn-vertex graph with independence number at most δn\delta n that admits a red/blue coloring with no red K3K_3 and no blue K7K_7. The (K3,K7)(K_3,K_7) density conjecture. For sufficiently small δ>0\delta>0,

ρ(3,7,δ)=716+δ2.\rho(3,7,\delta)=\frac{7}{16}+\frac{\delta}{2}.

The source gives a construction proving the corresponding lower bound. The conjecture is the assertion that this construction is asymptotically optimal for sufficiently small δ\delta.

References
  1. Xinyu Hu and Qizhong Lin, “Two Ramsey-Turán numbers involving triangles”, arXiv:2212.07234 (2023).

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.