Turán's theorem implies Stanley's bound
From MaRDI portal
Publication:2296007
Recommendations
Cites work
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A bound on the spectral radius of graphs with \(e\) edges
- Bounds on the spectral radius of graphs with e edges
- Lower bounds for the clique and the chromatic numbers of a graph
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the maximal index of graphs with a prescribed number of edges
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- On the spectral radius of (0,1)-matrices
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral bounds for the clique and independence numbers of graphs
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- Walks and the spectral radius of graphs
This page was built for publication: Turán's theorem implies Stanley's bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2296007)