6 research outputs found
Local resilience for squares of almost spanning cycles in sparse random graphs
In 1962, P\'osa conjectured that a graph contains a square of a
Hamiltonian cycle if . Only more than thirty years later
Koml\'os, S\'ark\H{o}zy, and Szemer\'edi proved this conjecture using the
so-called Blow-Up Lemma. Here we extend their result to a random graph setting.
We show that for every and a.a.s. every
subgraph of with minimum degree at least contains
the square of a cycle on vertices. This is almost best possible in
three ways: (1) for the random graph will not contain any
square of a long cycle (2) one cannot hope for a resilience version for the
square of a spanning cycle (as deleting all edges in the neighborhood of single
vertex destroys this property) and (3) for a.a.s. contains a
subgraph with minimum degree at least which does not contain the square
of a path on vertices
Local resilience of an almost spanning -cycle in random graphs
The famous P\'{o}sa-Seymour conjecture, confirmed in 1998 by Koml\'{o}s,
S\'{a}rk\"{o}zy, and Szemer\'{e}di, states that for any , every graph
on vertices with minimum degree contains the -th power of a
Hamilton cycle. We extend this result to a sparse random setting.
We show that for every there exists such that if then w.h.p. every subgraph of a random graph with
minimum degree at least , contains the -th power of a
cycle on at least vertices, improving upon the recent results of
Noever and Steger for , as well as Allen et al. for .
Our result is almost best possible in three ways: for the
random graph w.h.p. does not contain the -th power of any long
cycle; there exist subgraphs of with minimum degree and vertices not belonging to triangles; there exist
subgraphs of with minimum degree which do not
contain the -th power of a cycle on vertices.Comment: 24 pages; small updates to the paper after anonymous reviewers'
report
Walker-Breaker Games on
The Maker-Breaker connectivity game and Hamilton cycle game belong to the
best studied games in positional games theory, including results on biased
games, games on random graphs and fast winning strategies. Recently, the
Connector-Breaker game variant, in which Connector has to claim edges such that
her graph stays connected throughout the game, as well as the Walker-Breaker
game variant, in which Walker has to claim her edges according to a walk, have
received growing attention.
For instance, London and Pluh\'ar studied the threshold bias for the
Connector-Breaker connectivity game on a complete graph , and showed that
there is a big difference between the cases when Maker's bias equals or
. Moreover, a recent result by the first and third author as well as Kirsch
shows that the threshold probability for the Connector-Breaker
connectivity game on a random graph is of order
. We extent this result further to Walker-Breaker games and
prove that this probability is also enough for Walker to create a Hamilton
cycle
Counting extensions revisited
We consider rooted subgraphs in random graphs, i.e., extension counts such as
(i) the number of triangles containing a given vertex or (ii) the number of
paths of length three connecting two given vertices. In 1989, Spencer gave
sufficient conditions for the event that, with high probability, these
extension counts are asymptotically equal for all choices of the root vertices.
For the important strictly balanced case, Spencer also raised the fundamental
question whether these conditions are necessary. We answer this question by a
careful second moment argument, and discuss some intriguing problems that
remain open.Comment: 21 pages, 2 figure
Dirac-type theorems in random hypergraphs
For positive integers and divisible by , let be the
minimum -degree ensuring the existence of a perfect matching in a
-uniform hypergraph. In the graph case (where ), a classical theorem of
Dirac says that . However, in general, our
understanding of the values of is still very limited, and it is an
active topic of research to determine or approximate these values. In this
paper we prove a "transference" theorem for Dirac-type results relative to
random hypergraphs. Specifically, for any and any
"not too small" , we prove that a random -uniform hypergraph with
vertices and edge probability typically has the property that every
spanning subgraph of with minimum degree at least
has a perfect matching. One interesting aspect of
our proof is a "non-constructive" application of the absorbing method, which
allows us to prove a bound in terms of without actually knowing
its value