Li, Feng, and Liu's signless Laplacian spectral Turán conjecture
Li, Feng, and Liu's signless Laplacian spectral Turán conjecture
Let be a graph with edges. A graph is -free if it contains no complete subgraph on vertices. Let denote the largest eigenvalue of the signless Laplacian matrix of . Li, Feng, and Liu's conjecture. If is -free, then
The conjecture proposes a signless-Laplacian analogue of a spectral Turán inequality. The source presents it as a conjecture from Li, Feng, and Liu; no resolution is given here.
Sources & referencesView supporting material
Primary source
Lele Liu and Bo Ning, “Variants of spectral Turán theorems and eigenvectors of graphs”, arXiv:2312.16138 (2024).
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.