A spectral version of Mantel's theorem
A classic result in extremal graph theory, known as Mantel's theorem, implies that every non-bipartite graph of order n with size m>⌊n2/4⌋ contains a triangle. Recently, by majority technique, Lin, Ning and Wu obtained a spectral version as follows: every non-bipartite graph G of size m with...
Saved in:
Published in | Discrete mathematics Vol. 345; no. 1; p. 112630 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.01.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A classic result in extremal graph theory, known as Mantel's theorem, implies that every non-bipartite graph of order n with size m>⌊n2/4⌋ contains a triangle. Recently, by majority technique, Lin, Ning and Wu obtained a spectral version as follows: every non-bipartite graph G of size m with spectral radius ρ(G)≥m−1 contains a triangle unless G≅C5. In this paper, by using completely different techniques we show that every non-bipartite graph G of size m with ρ(G)≥ρ⁎(m) contains a triangle unless G≅SK2,m−12, where ρ⁎(m) is the largest root of x3−x2−(m−2)x+(m−3)=0 and SK2,m−12 is obtained by subdividing an edge of K2,m−12. This result implies both Mantel's theorem and Lin, Ning and Wu's result. Moreover, following Nikiforov's result, we also prove that every non-bipartite graph G with m≥26 and ρ(G)≥ρ(K1,m−1+e) contains a quadrilateral unless G≅K1,m−1+e. |
---|---|
ISSN: | 0012-365X 1872-681X |
DOI: | 10.1016/j.disc.2021.112630 |