How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?

In this paper we study the randomly edge colored graph that is obtained by adding randomly colored random edges to an arbitrary randomly edge colored dense graph. In particular we ask how many colors and how many random edges are needed so that the resultant graph contains a fixed number of edge disjoint rainbow Hamilton cycles. We also ask when in the resultant graph every pair of vertices is connected by a rainbow path.

[1]  Raphael Yuster,et al.  The rainbow connection of a graph is (at most) reciprocal to its minimum degree , 2010 .

[2]  Alan M. Frieze,et al.  Adding random edges to dense graphs , 2004, Random Struct. Algorithms.

[3]  Benny Sudakov,et al.  Bounded-Degree Spanning Trees in Randomly Perturbed Graphs , 2015, SIAM J. Discret. Math..

[4]  Benny Sudakov,et al.  Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs , 2015, Combinatorics, Probability and Computing.

[5]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[6]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[7]  B. Sudakov,et al.  On smoothed analysis in dense graphs and formulas , 2006 .

[8]  Alan M. Frieze,et al.  Rainbow hamilton cycles in random graphs , 2010, Random Struct. Algorithms.

[9]  Tom Bohman,et al.  How many random edges make a dense graph hamiltonian? , 2003, Random Struct. Algorithms.

[10]  Michael Krivelevich,et al.  Rainbow Hamilton cycles in random graphs and hypergraphs , 2015, 1506.02929.

[11]  Julia Böttcher,et al.  Embedding spanning bounded degree subgraphs in randomly perturbed graphs , 2017, Electron. Notes Discret. Math..

[12]  Asaf Ferber,et al.  Packing, counting and covering Hamilton cycles in random directed graphs , 2015, Electron. Notes Discret. Math..

[13]  Asaf Ferber,et al.  Packing a randomly edge-colored random graph with rainbow $k$-outs , 2014, 1410.1803.

[14]  Julia Böttcher,et al.  EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS , 2018 .