On the probability of independent sets in random graphs

DOI10.1002/rsa.10063zbMath1012.05144MaRDI QIDQ4798177

Van H. Vu, Michael Krivelevich, Nicholas C. Wormald, Benjamin Sudakov

Publication date: 19 March 2003

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10063

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

On-line list colouring of random graphs, Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro, Equitable coloring of random graphs, Local resilience of graphs

Cites Work

• Choice Numbers of Graphs: a Probabilistic Approach
• Unnamed Item