Sciweavers

IM
2007
13 years 11 months ago
The Spectral Gap of a Random Subgraph of a Graph
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
Fan R. K. Chung, Paul Horn
RSA
2006
66views more  RSA 2006»
13 years 11 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat