A spectral version of Mantel's theorem

DOI10.1016/j.disc.2021.112630zbMath1476.05130OpenAlexW3204604008MaRDI QIDQ2237213

Jin-Long Shu, Ming-qing Zhai

Publication date: 27 October 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112630

zbMATH Keywords

trianglespectral radiusquadrilateralMantel's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (18)

Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ On a generalization of the spectral Mantel's theorem ⋮ Spectral extremal graphs for the bowtie ⋮ Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size ⋮ Refinement on Spectral Turán’s Theorem ⋮ Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles ⋮ Spectral radius of graphs of given size with forbidden subgraphs ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ Maximum degree and spectral radius of graphs in terms of size ⋮ Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs ⋮ On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs ⋮ Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \) ⋮ A spectral extremal problem on non-bipartite triangle-free graphs ⋮ Spectral radius of graphs with given size and odd girth ⋮ The maximum spectral radius of graphs of given size with forbidden subgraph ⋮ Counting substructures and eigenvalues. I: Triangles ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• Lower bounds for the clique and the chromatic numbers of a graph
• Walks and the spectral radius of graphs
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• The spectral radius of trees on \(k\) pendant vertices
• Graphs without quadrilaterals
• On the number of edges of quadrilateral-free graphs
• Some upper bounds on the spectral radius of a graph
• Cliques and the spectral radius
• Some Inequalities for the Largest Eigenvalue of a Graph
• Über ein Problem von K. Zarankiewicz
• Eigenvalues and triangles in graphs
• On a problem of K. Zarankiewicz

This page was built for publication: A spectral version of Mantel's theorem