Cioabă, Desai and Tait's spectral Turán containment conjecture
Cioabă, Desai and Tait's spectral Turán containment conjecture
Let be a graph. Write for the family of -free graphs attaining the extremal number, and let denote the family of -free graphs attaining the maximum spectral radius. A graph family is Turán graphs plus edges if each of its graphs can be obtained from the appropriate Turán graph by adding edges. Cioabă, Desai and Tait's conjecture. If the graphs in are Turán graphs plus edges, then, for sufficiently large ,
This proposes a general condition under which spectral extremal graphs are also extremal in the ordinary Turán problem; the source gives examples where the containment is known, but does not state a resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Lele Liu and Bo Ning, “Spectral Turán-type problems on sparse spanning graphs”, arXiv:2307.14629 (2023).
Progress summary
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.