A spectral Erdős-Rademacher theorem

DOI10.1016/j.aam.2024.102720zbMath1542.05105MaRDI QIDQ6564068

Lu Lu, Yongtao Li, Yue Jian Peng

Publication date: 28 June 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

spectral radiusextremal graph problemscounting triangles

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Supersaturation problem for color-critical graphs
• On a theorem of Rademacher-Turán
• Walks and the spectral radius of graphs
• Spectral saturation: inverting the spectral Turán theorem
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Spectral bounds for the clique and independence numbers of graphs
• Vraagstuk XXVIII.
• The spectral radius of trees on \(k\) pendant vertices
• Counting substructures. I: Color critical graphs
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• The maximum spectral radius of irregular bipartite graphs
• A unique characterization of spectral extrema for friendship graphs
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
• The signless Laplacian spectral radius of graphs with a prescribed number of edges
• The maximum spectral radius of graphs without friendship subgraphs
• Adjacency eigenvalues of graphs without short odd cycles
• The spectral radius of graphs with no odd wheels
• A spectral condition for odd cycles in non-bipartite graphs
• Three conjectures in extremal spectral graph theory
• Bounds on graph eigenvalues. II
• On the extreme eigenvalues of regular graphs.
• Cliques and the spectral radius
• On a conjecture of spectral extremal problems
• Counting substructures and eigenvalues. I: Triangles
• Graph removal lemmas
• Regular Graphs, Eigenvalues and Regular Factors
• Some new results in extremal graph theory
• Some Inequalities for the Largest Eigenvalue of a Graph
• A Spectral Erdős–Stone–Bollobás Theorem
• Eigenvalues and triangles in graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the Number of Triangles Contained in Certain Graphs
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Spectral extremal graphs for the bowtie
• A Spectral Erdős-Sós Theorem
• A complete solution to the Cvetković–Rowlinson conjecture
• Refinement on Spectral Turán’s Theorem
• A spectral extremal problem on non-bipartite triangle-free graphs

This page was built for publication: A spectral Erdős-Rademacher theorem