Grzesik–Győri–Salia–Tompkins bipartite Turán-goodness conjecture
Grzesik–Győri–Salia–Tompkins bipartite Turán-goodness conjecture
A graph is -Turán-good when, for all sufficiently large , the Turán graph with two parts attains . The Grzesik–Győri–Salia–Tompkins conjecture. Every bipartite graph with diameter at most is -Turán-good. This is presented in the survey as a concrete open problem on Turán-goodness.
Sources & referencesView supporting material
Primary source
Dániel Gerbner and Cory Palmer, “Survey of generalized Turán problems – counting subgraphs”, arXiv:2506.03418 (2025).
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
Sign in to submit a solution.
No solutions have been posted yet.