Spectral supersaturation: triangles and bowties

Cites work

A complete solution to the Cvetković–Rowlinson conjecture
A contribution to the Zarankiewicz problem
A spectral Erdős-Rademacher theorem
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 spectral version of Mantel's theorem
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
A unique characterization of spectral extrema for friendship graphs
Books in graphs
Books versus triangles at the extremal density
Bounds on graph eigenvalues. II
Bowtie-free graphs have a Ramsey lift
Cliques and the spectral radius
Counting substructures and eigenvalues. I: Triangles
Counting substructures. I: Color critical graphs
Eigenvalues and triangles in graphs
Extremal graphs for intersecting cliques
Extremal graphs for intersecting triangles
Extremal problems involving vertices and edges on odd cycles
Extremal problems on planar graphs without k edge-disjoint cycles
Extremal spectral results of planar graphs without vertex-disjoint cycles
Graph removal lemmas
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 3685495 (Why is no real title available?)
scientific article; zbMATH DE number 3529891 (Why is no real title available?)
scientific article; zbMATH DE number 3372065 (Why is no real title available?)
scientific article; zbMATH DE number 3185004 (Why is no real title available?)
Large joints in graphs
Many \(T\) copies in \(H\)-free graphs
Minimizing the number of triangular edges
On a conjecture of spectral extremal problems
On a generalized Erdős–Rademacher problem
On maximal paths and circuits of graphs
On some papers of Nikiforov.
On stability of the Erdős-Rademacher problem
On the first two eigenvalues of regular graphs
On the Number of Triangles Contained in Certain Graphs
Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
Proofs from THE BOOK. Including illustrations by Karl H. Hofmann
Refinement on Spectral Turán’s Theorem
Some Inequalities for the Largest Eigenvalue of a Graph
Spectral bounds for the clique and independence numbers of graphs
Spectral extrema for graphs: the Zarankiewicz problem
Spectral extremal graphs for disjoint cliques
Spectral extremal graphs for the bowtie
Spectral extremal problem on disjoint color-critical graphs
Spectral extremal results with forbidding linear forests
Spectral radius of graphs with given size and odd girth
Stability for large forbidden subgraphs
Supersaturation problem for color-critical graphs
Supersaturation problem for the bowtie
The maximum spectral radius of graphs without friendship subgraphs
The maximum spectral radius of wheel-free graphs
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
The number of triangles is more when they have no common vertex
The spectral radius of graphs with no odd wheels
The typical structure of graphs with no large cliques
Three conjectures in extremal spectral graph theory

Cited in

(5)

A spectral generalized Alon-Frankl theorem
A spectral version of the theorem of Zykov and Erdős
A spectral generalized Erdős-Gallai theorem
Spectral extremal problems for non-bipartite graphs without odd cycles
More on Nosal's spectral theorem: books and 4-cycles

This page was built for publication: Spectral supersaturation: triangles and bowties

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