Extremal partition conjecture for generalized Ramsey–Turán clique density
Extremal partition conjecture for generalized Ramsey–Turán clique density
Let and be integers with . An extremal graph for the generalized Ramsey–Turán density is a graph admitting either an -partition when , or a -partition when . Extremal partition conjecture. There is an extremal graph for with the corresponding partition. The conjecture proposes a periodic extremal structure for generalized Ramsey–Turán densities; the paper studies conditions under which this structure holds and gives counterexamples, so its resolution is not established in the supplied text.
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
Jun Gao, Suyun Jiang, Hong Liu and Maya Sankar, “Generalized Ramsey–Turán density for cliques”, arXiv:2403.12919 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.