Skip to main content Accessibility help
×
Home

Loose Hamilton Cycles in Regular Hypergraphs

  • ANDRZEJ DUDEK (a1), ALAN FRIEZE (a2), ANDRZEJ RUCIŃSKI (a3) and MATAS ŠILEIKIS (a4)

Abstract

We establish a relation between two uniform models of random k-graphs (for constant k ⩾ 3) on n labelled vertices: ℍ (k) (n,m), the random k-graph with exactly m edges, and ℍ (k) (n,d), the random d-regular k-graph. By extending the switching technique of McKay and Wormald to k-graphs, we show that, for some range of d = d(n) and a constant c > 0, if m ~ cnd, then one can couple ℍ (k) (n,m) and ℍ (k) (n,d) so that the latter contains the former with probability tending to one as n → ∞. In view of known results on the existence of a loose Hamilton cycle in ℍ (k) (n,m), we conclude that ℍ (k) (n,d) contains a loose Hamilton cycle when d ≫ log n (or just dC log n, if k = 3) and d = o(n 1/2).

Copyright

References

Hide All
[1] Barbour, A. D., Holst, L. and Janson, S. (1992) Poisson Approximation, Vol. 2 of Oxford Studies in Probability, Oxford Science Publications, The Clarendon Press.
[2] Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296307.
[3] Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311316.
[4] Bollobás, B. (2001) Random Graphs, second edition, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.
[5] Bollobás, B. and Frieze, A. M. (1985) On matchings and Hamiltonian cycles in random graphs. In Random Graphs '83: Poznań 1983, Vol. 118 of North-Holland Mathematics Studies, North-Holland, pp. 2346.
[6] Chvátal, V. (1991) Almost all graphs with 1.44n edges are 3-colorable. Random Struct. Alg. 2 1128.
[7] Cooper, C., Frieze, A. and Reed, B. (2002) Random regular graphs of non-constant degree: Connectivity and Hamiltonicity. Combin. Probab. Comput. 11 249261.
[8] Dudek, A. and Frieze, A. (2011) Loose Hamilton cycles in random uniform hypergraphs. Electron. J. Combin. 18 #48.
[9] Dudek, A. and Frieze, A. (2013) Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Alg. 42 374385.
[10] Dudek, A., Frieze, A., Loh, P.-S. and Speiss, S. (2012) Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs. Electron. J. Combin. 19 #44.
[11] Dudek, A., Frieze, A., Ruciński, A. and Šileikis, M. (2013) Approximate counting of regular hypergraphs. Inform. Process. Lett. 113 785788.
[12] Frieze, A. (2010) Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. 17 note 28.
[13] Janson, S., Łuczak, T. and Rucinski, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience.
[14] Kim, J. H. and Vu, V. H. (2004) Sandwiching random graphs: Universality between random graph models. Adv. Math. 188 444469.
[15] Knuth, D. E. (1976) Big omicron and big omega and big theta. SIGACT News 8 1824.
[16] Krivelevich, M., Sudakov, B., Vu, V. H. and Wormald, N. C. (2001) Random regular graphs of high degree. Random Struct. Alg. 18 346363.
[17] McDiarmid, C. (1998) Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, Vol. 16 of Algorithms and Combinatorics, Springer, pp. 195248.
[18] McKay, B. D. and Wormald, N. C. (1990) Uniform generation of random regular graphs of moderate degree. J. Algorithms 11 5267.
[19] Robinson, R. W. and Wormald, N. C. (1992) Almost all cubic graphs are Hamiltonian. Random Struct. Alg. 3 117125.
[20] Robinson, R. W. and Wormald, N. C. (1994) Almost all regular graphs are Hamiltonian. Random Struct. Alg. 5 363374.
[21] Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics: Canterbury 1999, Vol. 267 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 239298.

Keywords

Related content

Powered by UNSILO

Loose Hamilton Cycles in Regular Hypergraphs

  • ANDRZEJ DUDEK (a1), ALAN FRIEZE (a2), ANDRZEJ RUCIŃSKI (a3) and MATAS ŠILEIKIS (a4)

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.