2 search results - page 1 / 1 » Randomized greedy algorithms for independent sets and matchi... |
CORR
2008
Springer
13 years 3 months ago
2008
Springer
JCT
2007
13 years 4 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 → ∞,...