32 research outputs found
Tilings in randomly perturbed dense graphs
A perfect -tiling in a graph is a collection of vertex-disjoint copies
of a graph in that together cover all the vertices in . In this
paper we investigate perfect -tilings in a random graph model introduced by
Bohman, Frieze and Martin in which one starts with a dense graph and then adds
random edges to it. Specifically, for any fixed graph , we determine the
number of random edges required to add to an arbitrary graph of linear minimum
degree in order to ensure the resulting graph contains a perfect -tiling
with high probability. Our proof utilises Szemer\'edi's Regularity lemma as
well as a special case of a result of Koml\'os concerning almost perfect
-tilings in dense graphs.Comment: 19 pages, to appear in CP
Rainbow connectivity of randomly perturbed graphs
In this note we examine the following random graph model: for an arbitrary
graph , with quadratic many edges, construct a graph by randomly adding
edges to and randomly coloring the edges of with colors. We
show that for a large enough constant and , every pair of
vertices in are joined by a rainbow path, i.e., is {\it rainbow
connected}, with high probability. This confirms a conjecture of Anastos and
Frieze [{\it J. Graph Theory} {\bf 92} (2019)] who proved the statement for and resolved the case when and is a function of .Comment: Some typos and errors fixe
Cycle factors in randomly perturbed graphs
We study the problem of finding pairwise vertex-disjoint copies of the ω>-vertex cycle Cω>in the randomly perturbed graph model, which is the union of a deterministic n-vertex graph G and the binomial random graph G(n, p). For ω>≥ 3 we prove that asymptotically almost surely G U G(n, p) contains min{δ(G), min{δ(G), [n/l]} pairwise vertex-disjoint cycles Cω>, provided p ≥ C log n/n for C sufficiently large. Moreover, when δ(G) ≥ αn with 0 ≤ α/l and G and is not 'close' to the complete bipartite graph Kαn(1 - α)n, then p ≥ C/n suffices to get the same conclusion. This provides a stability version of our result. In particular, we conclude that p ≥ C/n suffices when α > n/l for finding [n/l] cycles Cω>. Our results are asymptotically optimal. They can be seen as an interpolation between the Johansson-Kahn-Vu Theorem for Cω>-factors and the resolution of the El-Zahar Conjecture for Cω>-factors by Abbasi
Smoothed Analysis of the Koml\'os Conjecture: Rademacher Noise
The {\em discrepancy} of a matrix is given by
. An outstanding conjecture, attributed to Koml\'os,
stipulates that , whenever is a Koml\'os matrix,
that is, whenever every column of lies within the unit sphere. Our main
result asserts that holds
asymptotically almost surely, whenever is
Koml\'os, is a Rademacher random matrix, , and . We conjecture that suffices for the same assertion to hold. The factor
normalising is essentially best possible.Comment: For version 2, the bound on the discrepancy is improve
Karp's patching algorithm on random perturbations of dense digraphs
We consider the following question. We are given a dense digraph with
minimum in- and out-degree at least , where is a constant.
We then add random edges to to create a digraph . Here an edge
is placed independently into with probability where
is a small positive constant. The edges of are given edge
costs , where is an independent copy of the exponential
mean one random variable i.e. . Let
be the associated cost matrix where
if . We show that w.h.p. the patching
algorithm of Karp finds a tour for the asymmetric traveling salesperson problem
that is asymptotically equal to that of the associated assignment problem.
Karp's algorithm runs in polynomial time.Comment: Fixed the proof of a lemm