Abstract
Let H be an edge-colored hypergraph. We say that H contains a rainbow copy of a hypergraph S if it contains an isomorphic copy of S with all edges of distinct colors. We consider the following setting. A randomly edge-colored random hypergraph \(H \sim \mathcal{H}_{c}^{k}(n,p)\) is obtained by adding each k-subset of [n] with probability p, and assigning it a color from [c] uniformly, independently at random. As a first result we show that a typical \(H \sim \mathcal{H}_{c}^{2}(n,p)\) (that is, a random edge-colored graph) contains a rainbow Hamilton cycle, provided that \(c = (1 + o(1))n\) and \(p = \frac{\log n+\log \log n+\omega (1)} {n}\). This is asymptotically best possible with respect to both parameters, and improves a result of Frieze and Loh. Secondly, based on an ingenious coupling idea of McDiarmid, we provide a general tool for tackling problems related to finding “nicely edge-colored” structures in random graphs/hypergraphs. We illustrate the generality of this statement by presenting two interesting applications. In one application we show that a typical \(H \sim \mathcal{H}_{c}^{k}(n,p)\) contains a rainbow copy of a hypergraph S, provided that \(c = (1 + o(1))\vert E(S)\vert\) and p is (up to a multiplicative constant) a threshold function for the property of containment of a copy of S. In the second application we show that a typical \(G \sim \mathcal{H}_{c}^{2}(n,p)\) contains \((1 - o(1))np/2\) edge-disjoint Hamilton cycles, each of which is rainbow, provided that c = ω(n) and \(p =\omega (\log n/n)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Aharoni, P. Haxell, Hall’s theorem for hypergraphs. J. Graph Theory 35, 83–88 (2000)
N. Alon, J.H. Spencer, The Probabilistic Method, 3rd edn. (Wiley, New York, 2008)
D. Bal, A. Frieze, Rainbow matchings and Hamilton cycles in random graphs (2013). arXiv preprint [arXiv:1311.6423]
I. Ben-Eliezer, M. Krivelevich, B. Sudakov, The size Ramsey number of a directed path. J. Comb. Theory Ser. B 102, 743–755 (2012)
S. Ben-Shimon, A. Ferber, D. Hefetz, M. Krivelevich, Hitting time results for Maker-Breaker games, in Proceedings of the 22nd Symposium on Discrete Algorithms (SODA’11), pp. 900–912. Journal version: Random Struct. Alg. 41, 23–46 (2012)
B. Bollobás, Random Graphs, 2nd edn. (Cambridge University Press, Cambridge, 2001)
C. Cooper, A. Frieze, Multi-coloured Hamilton cycles in random edge-coloured graphs. Comb. Probab. Comput. 11, 129–133 (2002)
A. Dudek, A. Frieze, Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Alg. 42, 374–385 (2013)
A. Ferber, M. Krivelevich, H. Naves, Generating random graphs in biased Maker-Breaker games. Random Struct. Alg. 47, 615–634 (2015)
A. Ferber, R. Nenadov, U. Peter, Universality of random graphs and rainbow embedding. Random Struct. Alg. (to appear)
A. Frieze, P.-S. Loh, Rainbow Hamilton cycles in random graphs. Random Struct. Alg. 44, 328–354 (2014)
S. Janson, T. Łuczak, A. Rucinski, Random Graphs (Wiley, New York, 2000)
A. Johansson, J. Kahn, V. Vu, Factors in random graphs. Random Struct. Alg. 33, 1–28 (2008)
F. Knox, D. Kühn, D. Osthus, Edge-disjoint Hamilton cycles in random graphs. Random Struct. Alg. 46, 397–445 (2015)
M. Krivelevich, W. Samotij, Optimal packings of Hamilton cycles in sparse random graphs. SIAM J. Disc. Math. 26, 964–982 (2012)
M. Krivelevich, C. Lee, B. Sudakov, Compatible Hamilton cycles in random graphs (2014). arXiv preprint [arXiv:1410.1438]
D. Kühn, D. Osthus, Hamilton decompositions of regular expanders: applications. J. Comb. Theory Ser. B 104, 1–27 (2014)
C. McDiarmid, Clutter percolation and random graphs. Math. Program. Stud. 13, 17–25 (1980)
L. Pósa, Hamiltonian circuits in random graphs. Disc. Math. 14, 359–364 (1976)
D.B. West, Introduction to Graph Theory (Prentice Hall, Upper Saddle River, 2001)
Acknowledgements
The research of Michael Krivelevich was supported in part by USA-Israel BSF grant 2010115 and by grant 912/12 from the Israel Science Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Ferber, A., Krivelevich, M. (2016). Rainbow Hamilton cycles in random graphs and hypergraphs. In: Beveridge, A., Griggs, J., Hogben, L., Musiker, G., Tetali, P. (eds) Recent Trends in Combinatorics. The IMA Volumes in Mathematics and its Applications, vol 159. Springer, Cham. https://doi.org/10.1007/978-3-319-24298-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-24298-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24296-5
Online ISBN: 978-3-319-24298-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)