A proof of Alon's second eigenvalue conjecture and related problems
离散数学
2007-05-23 v1 组合数学
摘要
In this paper we show the following conjecture of Noga Alon. Fix a positive integer d>2 and real epsilon > 0; consider the probability that a random d-regular graph on n vertices has the second eigenvalue of its adjacency matrix greater than 2 sqrt(d-1) + epsilon; then this probability goes to zero as n tends to infinity. We prove the conjecture for a number of notions of random d-regular graph, including models for d odd. We also estimate the aforementioned probability more precisely, showing in many cases and models (but not all) that it decays like a polynomial in 1/n.
引用
@article{arxiv.cs/0405020,
title = {A proof of Alon's second eigenvalue conjecture and related problems},
author = {Joel Friedman},
journal= {arXiv preprint arXiv:cs/0405020},
year = {2007}
}
备注
To appear in Memoirs of the American Mathematical Society. 118 pages. This newer version should have a two page glossary