Probabilistic Methods in Combinatorics

171 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Flag algebras (2007, unknown): “And, trying to revive an extremely handy but unfortunately almost entirely forgotten convention from the classical book [ErSp], we always use math boldface for denoting random objects.”
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey (2014, background): “The original proof in [59] provides an upper bound and Galvin [63] (p.”
SPECTRAL DISTRIBUTIONS OF ADJACENCY AND LAPLACIAN MATRICES OF RANDOM GRAPHS (2010, background): “One can see, for example, [9, 13, 14, 15, 17, 22, 29, 33, 39] for book-length treatments.”
The early evolution of the H-free process (2009, methodology): “Our proofs use the differential equations method for random graph processes to analyse the evolution of the process, and give further information about the structure of the graphs obtained, including asymptotic formulae for a broad class of subgraph extension variables.”
Surveys in Combinatorics 2011: Hypergraph Turán problems (2011, methodology): “A simple probabilistic lower bound due to Erdős and Spencer [61] is obtained by taking the random graph Gn,p and deleting an edge from each copy of Kr,r.”