Large independent sets in random regular graphs

doi:10.1016/j.tcs.2009.08.025

Theoretical Computer Science

Volume 410, Issue 50, 17 November 2009, Pages 5236-5243

https://doi.org/10.1016/j.tcs.2009.08.025 Get rights and content

Under an Elsevier user license

open archive

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 \geq 3$ . For instance, for $d = 3$ we prove that, for graphs on $n$ vertices, $s_{d} \geq 0.43475 n$ with probability approaching one as $n$ tends to infinity.

Keywords

Random graphs

Independent sets

Approximation algorithms

Cited by (0)

^☆: Part of this work was carried out during a visit of the second author to the Australian National University (ANU).

Theoretical Computer Science

Large independent sets in random regular graphs☆

Abstract

Keywords