Turán's theorem implies Stanley's bound

DOI10.7151/DMGT.2287zbMATH Open1433.05203OpenAlexW2998094925WikidataQ126413261 ScholiaQ126413261MaRDI QIDQ2296007FDOQ2296007

Authors: 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

Recommendations

• Bounds on eigenvalues and chromatic numbers
• A bound on the spectral radius of graphs with \(e\) edges
• Spectral bounds for the clique and independence numbers of graphs
• A Turan theorem relating to the spectral radius of a graph
• A bound on the spectral radius of graphs

zbMATH Keywords

clique numberwalksgraph spectral radiusMotzkin-Straus's inequalityStanley's boundTurán's theorem

Mathematics Subject Classification ID

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

Cites Work

• Some Inequalities for the Largest Eigenvalue of a Graph
• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Title not available (Why is that?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Lower bounds for the clique and the chromatic numbers of a graph
• On the maximal index of graphs with a prescribed number of edges
• Walks and the spectral radius of graphs
• Spectral bounds for the clique and independence numbers of graphs
• Title not available (Why is that?)
• A bound on the spectral radius of graphs with \(e\) edges
• Bounds on the spectral radius of graphs with e edges

Cited In (2)

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

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)