The paper establishes asymptotic lower bounds on shared-edge triangles, shared-vertex cliques, and C4 copies in graphs with spectral radius > √m, confirming three conjectures with matching constructions.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
More on Nosal's spectral theorem: Books and $4$-cycles
The paper establishes asymptotic lower bounds on shared-edge triangles, shared-vertex cliques, and C4 copies in graphs with spectral radius > √m, confirming three conjectures with matching constructions.