Learn More
Let e1, e2,. .. be a sequence of edges chosen uniformly at random from the edge set of the complete graph Kn (i.e. we sample with replacement). Our goal is to choose, for m as large as possible, a subset such that the size of the largest component in G = ([n], E) is o(n) (i.e. G does not contain a giant component). Furthermore, the selection process must(More)
Let c be a constant and a sequence of ordered pairs of edges from the complete graph K n chosen uniformly and independently at random. We prove that there exists a constant c 2 such that if c > c 2 then whp every graph which contains at least one edge from each ordered pair (e i , f i) has a component of size Ω(n) and if c < c 2 then whp there is a graph(More)
The triangle-free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle-free graph at which the triangle-free process terminates. We also bound the independence number of this graph, which(More)
Let 3 ≤ k < n/2. We prove the analogue of the Erd˝ os-Ko-Rado theorem for the random k-uniform hypergraph G k (n, p) when k < (n/2) 1/3 ; that is, we show that with probability tending to 1 as n → ∞, the maximum size of an intersecting subfamily of G k (n, p) is the size of a maximum trivial family. The analogue of the Erd˝ os-Ko-Rado theorem does not hold(More)
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D > N ǫ for some ǫ > 0. Consider the random greedy algorithm for forming an independent set in H. An independent set is chosen at random by iteratively choosing vertices at random to be in the independent set. At each step we chose a vertex uniformly(More)
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number χ g (G) is the minimum k for which the first player has a winning strategy. In this(More)