Extremal partition conjecture for generalized Ramsey–Turán clique density

From papers

Let ss and tt be integers with 3st23\leq s\leq t-2. An extremal graph for the generalized Ramsey–Turán density ϱs(Kt)\varrho_s(K_t) is a graph admitting either an (s,t1s)(s,t-1-s)-partition when s+2t2s1s+2\leq t\leq 2s-1, or a (t/2,t1t/2)(\lfloor t/2\rfloor,t-1-\lfloor t/2\rfloor)-partition when t2st\geq 2s. Extremal partition conjecture. There is an extremal graph for ϱs(Kt)\varrho_s(K_t) 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

No solutions have been posted yet.