Counting substructures and eigenvalues. I: Triangles

DOI10.1016/j.ejc.2023.103685OpenAlexW4317470324MaRDI QIDQ2700994

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

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

Related Items (2)

Spectral extremal graphs for the bowtie ⋮ A spectral extremal problem on non-bipartite triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On a theorem of Rademacher-Turán
• Lower bounds for the clique and the chromatic numbers of a graph
• Walks and the spectral radius of graphs
• Spectral saturation: inverting the spectral Turán theorem
• Extremal graphs for intersecting triangles
• Counting substructures. I: Color critical graphs
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• The maximum spectral radius of graphs without friendship subgraphs
• A spectral version of Mantel's theorem
• Cliques and the spectral radius
• Some new results in extremal graph theory
• On some papers of Nikiforov
• Eigenvalues and triangles in graphs
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs

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