You need to know: Graph, independent set in a graph, maximum independent set, d-regular graph, probability, selection uniformly at random, convergence in probability.
Background: The independence ratio of n-vertex graph G is the size of its maximum independent set divided by n. For positive integers
with
even, let
denote the uniformly random d-regular graph on n vertices, sampled as follows: start with n isolated vertices each equipped with d labelled half-edges, and form the graph by taking a uniformly random matching on the
half-edges. For fixed d, let
.
For positive integer d, consider functions ,
, and
. Let
be the largest
such that
, and let
.
The Theorem: On 17th October 2013, Jian Ding, Allan Sly, and Nike Sun submitted to arxiv a paper in which they proved the existence of constant such that for all
the independence ratio
of the random d-regular graph
converges in probability to
.
Short context: Determining the size of maximum independent set in random d-regular graph is not only a problem interesting in its own, but also has connection to statistical physics. In fact, the Theorem, including explicit formula for , has been derived in 2005 using non-rigorous analysis with physical origin (called replica symmetry breaking heuristics). The Theorem confirms this prediction rigorously.
Links: Free arxiv version of the original paper is here, journal version is here.