Sciweavers

CORR
2004
Springer
83views Education» more  CORR 2004»
13 years 11 months ago
A proof of Alon's second eigenvalue conjecture and related problems
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
Joel Friedman
DM
2007
93views more  DM 2007»
13 years 11 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
APPROX
2004
Springer
129views Algorithms» more  APPROX 2004»
14 years 4 months ago
The Chromatic Number of Random Regular Graphs
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
Dimitris Achlioptas, Cristopher Moore
MFCS
2007
Springer
14 years 5 months ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
William Duckworth, Michele Zito
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 11 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu