For r>=3, k>=1 and sufficiently large n, the unique spectral extremal graph among non-r-partite B_{r,k}-free graphs is Y_r(n), obtained from the Turán graph T_r(n) by one internal edge and some cross-edge deletions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Spectral Tur\'an-type problem in non-$r$-partite graphs: Forbidden generalized book graph $B_{r,k}$
For r>=3, k>=1 and sufficiently large n, the unique spectral extremal graph among non-r-partite B_{r,k}-free graphs is Y_r(n), obtained from the Turán graph T_r(n) by one internal edge and some cross-edge deletions.