Independent sets in random graphs from the weighted second moment method

Authors:
Varsha Dani;Cristopher Moore
Affiliations:
Computer Science Department, University of New Mexico;Santa Fe Institute
Venue:
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Year:
2011

Citing 6
Cited 0

Sharp concentration of the chromatic number on random graphs Gn,p

Combinatorica
On the independence number of random graphs

Discrete Mathematics
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold

SIAM Journal on Computing
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

Proceedings of the forty-second ACM symposium on Theory of computing
On independent sets in random graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove new lower bounds on the likely size of the maximum independent set in a random graph with a given constant 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.