Counting substructures and eigenvalues. I: Triangles

DOI10.1016/J.EJC.2023.103685MaRDI QIDQ2700994zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 April 2023

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.12937

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx) Algebraic combinatorics (05Exx)

Recommendations

• Lower bounds on the number of triangles in a graph
• Eigenvalues and triangles in graphs
• On some papers of Nikiforov.
• Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
• A spectral version of Mantel's theorem

Cites work

• A spectral version of Mantel's theorem
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Cliques and the spectral radius
• Counting substructures. I: Color critical graphs
• Eigenvalues and triangles in graphs
• Extremal graphs for intersecting triangles
• scientific article; zbMATH DE number 3821782 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3723610 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Lower bounds for the clique and the chromatic numbers of a graph
• On a theorem of Rademacher-Turán
• On some papers of Nikiforov.
• Some new results in extremal graph theory
• Spectra of graphs
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Spectral saturation: inverting the spectral Turán theorem
• The maximum spectral radius of graphs without friendship subgraphs
• Walks and the spectral radius of graphs

Cited in

(18)

• Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
• On some papers of Nikiforov.
• Lower bounds on the number of triangles in a graph
• Eigenvalues and triangles in graphs
• Spectral extremal graphs for the bowtie
• A spectral extremal problem on non-bipartite triangle-free graphs
• Counting substructures and eigenvalues I: triangles
• A spectral Erdős-Rademacher theorem
• Spectral radius and rainbow Hamilton paths of a graph
• Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
• Counting substructures and eigenvalues. II: Quadrilaterals
• A spectral Erdős-Faudree-Rousseau theorem
• Spectral supersaturation: triangles and bowties
• A refinement on spectral Mantel's theorem
• Spectral extremal graphs for fan graphs
• More on Nosal's spectral theorem: books and 4-cycles
• Some Turán-type results for the signless Laplacian spectral radius
• Bounds for the largest eigenvalue and sum of Laplacian eigenvalues of signed graphs

This page was built for publication: Counting substructures and eigenvalues. I: Triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700994)