Large independent sets in random regular graphs

Authors:
William Duckworth;Michele Zito
Affiliations:
Mathematical Sciences Institute, Australian National University, Canberra, ACT 0200, Australia;Department of Computer Science, University of Liverpool, Liverpool L69 3BX, United Kingdom
Venue:
Theoretical Computer Science
Year:
2009

Citing 10
Cited 1

On the independence number of random graphs

Discrete Mathematics
On the independence and chromatic numbers of random regular graphs

Journal of Combinatorial Theory Series B
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Algorithmic theory of random graphs

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Approximation algorithms for independent sets in map graphs

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial algorithm for finding the largest independent sets in graphs without forks

Discrete Applied Mathematics
3-star factors in random d-regular graphs

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Maximum induced matchings of random regular graphs

IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory

Survey: The cook-book approach to the differential equation method

Computer Science Review

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present algorithmic lower bounds on the size s"d of the largest independent sets of vertices in random d-regular graphs, for each fixed d=3. For instance, for d=3 we prove that, for graphs on n vertices, s"d=0.43475n with probability approaching one as n tends to infinity.