Adding random edges to create the square of a Hamilton cycle
نویسندگان
چکیده
We consider how many random edges need to be added to a graph of order n with minimum degree αn in order that it contains the square of a Hamilton cycle w.h.p..
منابع مشابه
Robustness of Pósa’s conjecture Master Thesis
The kth power of a cycle is obtained by adding an edge between all pairs of vertices whose distance on the cycle is at most k. In 1962, Pósa conjectured that a graph G on n vertices contains a square of a Hamilton cycle if it has minimum degree δ(G) ≥ 3 n, and, 11 years later, Seymour claimed that δ(G) ≥ k k+1 n is sufficient for the appearance of a kth power of a Hamilton cycle for any k ≥ 2. ...
متن کاملHamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are presented with K = K(n) edges, chosen uniformly at random from the missing ones, and are asked to add one of them to the current graph. The goal is to create a Hamilton cycle as soon as possible. We show that this problem...
متن کاملCycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves a nonstan...
متن کاملExpected numbers at hitting times
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers for example of perfect matchings, spanning trees, hamilton paths and directed hamilton cycles.
متن کاملHamilton-chain saturated hypergraphs
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) hamiltonian chain in H. In this paper we ask about the smallest size of an r-uniform hamiltonian path (cycle) saturated hypergraph, mainly for r = 3. We present a construction of a family of 3-uniform path (cycle) saturat...
متن کامل