A spectral Erdős-Rademacher theorem

DOI10.1016/J.AAM.2024.102720MaRDI QIDQ6564068zbMATH OpenFDO

Authors Yongtao Li, Lu Lu, Yuejian Peng

Publication date 28 June 2024

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

Full work available at URL https://doi.org/10.1016/J.AAM.2024.102720

zbMATH Keywords

counting trianglesextremal graph problemsspectral radius

Mathematics Subject Classification ID

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

Recommendations

• Counting substructures and eigenvalues. I: Triangles
• On stability of the Erdős-Rademacher problem
• A Spectral Erdős-Sós Theorem
• On a generalized Erdős–Rademacher problem
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs

Cites work

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

Cited in

(5)

• A tensor's spectral bound on the clique number
• A spectral version of the theorem of Zykov and Erdős
• A spectral Erdős-Faudree-Rousseau theorem
• Spectral supersaturation: triangles and bowties
• More on Nosal's spectral theorem: books and 4-cycles

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)