Turán's theorem implies Stanley's bound

DOI10.7151/dmgt.2287zbMath1433.05203OpenAlexW2998094925WikidataQ126413261 ScholiaQ126413261MaRDI QIDQ2296007

Yanyan Li

Publication date: 17 February 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2287

zbMATH Keywords

clique numberwalksTurán's theoremgraph spectral radiusMotzkin-Straus's inequalityStanley's bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (2)

Signed spectral Turań-type theorems ⋮ Eigenvalues and chromatic number of a signed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds for the clique and the chromatic numbers of a graph
• Walks and the spectral radius of graphs
• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• Spectral bounds for the clique and independence numbers of graphs
• Bounds on the spectral radius of graphs with e edges
• 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
• A bound on the spectral radius of graphs with \(e\) edges
• Some Inequalities for the Largest Eigenvalue of a Graph
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Turán's theorem implies Stanley's bound