Weighted-graph reformulation of the extremal partition conjecture
Fix integers and with . A weighted graph admitting a -partition has vertices and parts satisfying the defining partition conditions for the weighted-graph reduction. Weighted-graph reformulation. The maximum -density among weighted graphs admitting a -partition is attained when
This is the weighted-graph form of the proposed extremal periodicity principle; the supplied text explains that the paper proves both conditions under which it holds and counterexamples, while no complete resolution is stated here.
References
- Jun Gao, Suyun Jiang, Hong Liu and Maya Sankar, “Generalized Ramsey–Turán density for cliques”, arXiv:2403.12919 (2024).
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.