No CrossRef data available.
Article contents
A Spectral Turán Theorem
Published online by Cambridge University Press: 11 October 2005
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
If all nonzero eigenvalues of the (normalized) Laplacian of a graph $G$ are close to 1, then $G$ is $t$-Turán in the sense that any subgraph of $G$ containing no $K_{t+1}$ contains at most $(1-1/t + o(1) ) e(G)$ edges where $e(G)$ denotes the number of edges in G.
Information
- Type
- Paper
- Information
- Copyright
- 2005 Cambridge University Press
You have
Access
- 4
- Cited by