On the probability of independent sets in random graphs
From MaRDI portal
Publication:4798177
DOI10.1002/rsa.10063zbMath1012.05144OpenAlexW2006081156MaRDI 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
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (8)
On Induced Paths, Holes, and Trees in Random Graphs ⋮ Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro ⋮ On the sizes of large subgraphs of the binomial random graph ⋮ On-line list colouring of random graphs ⋮ Hölder-type inequalities and their applications to concentration and correlation bounds ⋮ Equitable coloring of random graphs ⋮ Local resilience of graphs ⋮ The size of a maximum subgraph of the random graph with a given number of edges
Cites Work
This page was built for publication: On the probability of independent sets in random graphs
