The kK_{r+1}-free n-vertex graph with maximum t-clique spectral radius is K_{k-1} joined to T_r(n-k+1) for sufficiently large n.
Simonovits, A method for solving extremal problems in graph theory, stability problems, Theory of Graphs (Proc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generalized spectral Tur\'an problems for disjoint cliques
The kK_{r+1}-free n-vertex graph with maximum t-clique spectral radius is K_{k-1} joined to T_r(n-k+1) for sufficiently large n.