The general Ramsey–Turán formula conjecture for
The general Ramsey–Turán formula conjecture for
For each integer , let denote the Ramsey–Turán density for graphs admitting a 2-edge-coloring with no monochromatic blue and no monochromatic red , and let denote the classical Ramsey number. The general Ramsey–Turán formula conjecture.
This statement appears in an ignored concluding passage and is presented as a conjecture about the wide-open values of for ; its resolution is not supplied, so it remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Xinyu Hu and Qizhong Lin, “A step towards the Ramsey-Turán conjecture for K_3 and K_6”, arXiv:2409.04042 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.