Counting substructures and eigenvalues. II: Quadrilaterals
From MaRDI portal
Cites work
- A Brualdi-Hoffman-Turán problem on cycles
- A contribution to the Zarankiewicz problem
- A spectral extremal problem on non-bipartite triangle-free graphs
- A spectral version of Mantel's theorem
- A survey on spectral conditions for some extremal graph problems
- Counting substructures and eigenvalues. I: Triangles
- Eigenvalues and triangles in graphs
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3900799 (Why is no real title available?)
- scientific article; zbMATH DE number 1131467 (Why is no real title available?)
- scientific article; zbMATH DE number 3031694 (Why is no real title available?)
- Minimizer graphs for a class of extremal problems
- On the first eigenvalue of bipartite graphs
- On the spread of the spectrum of a graph
- Open problems of Paul Erd�s in graph theory
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some new results in extremal graph theory
- Spectra of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Spectral Radius and Degree Sequence
- Spectral radius of graphs with given size and odd girth
- Spektren endlicher Grafen
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- The maximum spectral radius of C₄-free graphs of given order and size
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Walks and the spectral radius of graphs
This page was built for publication: Counting substructures and eigenvalues. II: Quadrilaterals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901262)
