A Spectral Turán Theorem
暂无分享,去创建一个
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.
[1] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[2] N. Alon. Eigenvalues and expanders , 1986, Comb..
[3] Fan Chung Graham,et al. The Spectra of Random Graphs with Given Expected Degrees , 2004, Internet Math..
[4] Benny Sudakov,et al. A generalization of Turán's theorem , 2005, J. Graph Theory.
[5] B. Sudakov,et al. Pseudo-random Graphs , 2005, math/0503745.