Independent sets in random graphs from the weighted second moment method
Computational Complexity
2011-11-15 v2 Statistical Mechanics
Combinatorics
Probability
Abstract
We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give each independent set a weight based on the total degree of its vertices.
Cite
@article{arxiv.1011.0180,
title = {Independent sets in random graphs from the weighted second moment method},
author = {Varsha Dani and Cristopher Moore},
journal= {arXiv preprint arXiv:1011.0180},
year = {2011}
}