231 search results - page 1 / 47 » The Number of Independent Sets in a Regular Graph |
CPC
2010
14 years 7 months ago
2010
JCT
2007
14 years 10 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
CPC
2006
14 years 10 months ago
2006
CPC
2002
14 years 10 months ago
2002
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
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 ...