A spectral Erdős-Rademacher theorem

DOI10.1016/J.AAM.2024.102720zbMATH Open1542.05105MaRDI QIDQ6564068FDOQ6564068

Lu Lu, Yongtao Li, Yuejian 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

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

Cites Work

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

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