Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-20T00:27:21.541Z Has data issue: false hasContentIssue false
  • English
  • Français

A Spectral Turán Theorem

Published online by Cambridge University Press:  11 October 2005

FAN CHUNG
FAN CHUNG
Affiliation:
Department of Mathematics, University of California, San Diego, CA 92093-0112, USA (e-mail: fan@ucsd.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 14 , Issue 5-6 , November 2005 , pp. 755 - 767
Copyright
2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)