Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-qpj69 Total loading time: 0.248 Render date: 2021-03-07T19:15:24.037Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
Combinatorics, Probability and Computing Combinatorics, Probability and Computing

Article contents

Counting Hamilton cycles in Dirac hypergraphs

Part of: Graph theory

Published online by Cambridge University Press:  17 December 2020

Stefan Glock ,
Stephen Gould ,
Felix Joos ,
Daniela Kühn  and
Deryk Osthus
Stefan Glock
Affiliation:
ETH Institute for Theoretical Studies, Clausiusstrasse 47, 8092 Zürich, Switzerland
Stephen Gould
Affiliation:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
Felix Joos
Affiliation:
Institut für Informatik, Heidelberg University, Germany
Daniela Kühn
Affiliation:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
Deryk Osthus
Affiliation:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
Corresponding
E-mail address:
joos@informatik.uni-heidelberg.de
Get access
Rights & Permissions[Opens in a new window]

Abstract

A tight Hamilton cycle in a k-uniform hypergraph (k-graph) G is a cyclic ordering of the vertices of G such that every set of k consecutive vertices in the ordering forms an edge. Rödl, Ruciński and Szemerédi proved that for $k\ge 3$ , every k-graph on n vertices with minimum codegree at least $n/2+o(n)$ contains a tight Hamilton cycle. We show that the number of tight Hamilton cycles in such k-graphs is ${\exp(n\ln n-\Theta(n))}$ . As a corollary, we obtain a similar estimate on the number of Hamilton ${\ell}$ -cycles in such k-graphs for all ${\ell\in\{0,\ldots,k-1\}}$ , which makes progress on a question of Ferber, Krivelevich and Sudakov.

MSC classification

Primary: 05C65: Hypergraphs
Secondary: 05C81: Random walks on graphs 05C45: Eulerian and Hamiltonian graphs
Type
Paper
Information
Combinatorics, Probability and Computing , First View , pp. 1 - 23
Check for updates
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

Footnotes

†

This project has received partial funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement 786198, D. Kühn and D. Osthus). The research leading to these results was also partially supported by the EPSRC, grants EP/N019504/1 (S. Glock and D. Kühn) and EP/S00100X/1 (D. Osthus), and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), grants 339933727 and 428212407 (F. Joos), as well as the Royal Society and the Wolfson Foundation (D. Kühn).

References

Aigner-Horev, E. and Levy, G. (2020) Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. Combin. Probab. Comput. doi: 10.1017/S0963548320000486 CrossRefGoogle Scholar
Bermond, J.-C., Germa, A., Heydemann, M.-C. and Sotteau, D. (1976) Hypergraphes Hamiltoniens. Prob. Comb. Theorie Graph Orsay 260 39–43.Google Scholar
Bollobás, B. (1995) Extremal graph theory. In Handbook of Combinatorics, Vol II (Graham, R. L. et al., eds), pp. 1231–1292. Elsevier Science.Google Scholar
Bondy, J. A. (1995) Basic graph theory: paths and circuits. In Handbook of Combinatorics, Vol I (Graham, R. L. et al., eds), pp. 3–110. Elsevier Science.Google Scholar
Chung, F. and Lu, L. (2006) Concentration inequalities and martingale inequalities: a survey. Internet Math. 3 79–127.CrossRefGoogle Scholar
Coulson, M., Keevash, P., Perarnau, G. and Yepremyan, L. (2020) Rainbow factors in hypergraphs. J. Combin. Theory Ser. A 172 105184.Google Scholar
Cuckler, B. and Kahn, J. (2009) Entropy bounds for perfect matchings and Hamiltonian cycles. Combinatorica 29 327–335.CrossRefGoogle Scholar
Cuckler, B. and Kahn, J. (2009) Hamiltonian cycles in Dirac graphs. Combinatorica 29 299–326.CrossRefGoogle Scholar
Czygrinow, A. and Molla, T. (2014) Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs. SIAM J. Discrete Math. 28 67–76.Google Scholar
Dirac, G. A. (1952) Some theorems on abstract graphs. Proc. Lond. Math. Soc. 3 69–81.Google Scholar
Durrett, R. (2019) Probability: Theory and Examples, Vol. 49 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press.Google Scholar
Ferber, S., Krivelevich, M. and Sudakov, B. (2016) Counting and packing Hamilton $\ell$ -cycles in dense hypergraphs. J. Combin. 7 135–157.CrossRefGoogle Scholar
Hàn, H. and Schacht, M. (2010) Dirac-Type results for loose Hamilton cycles in uniform hypergraphs. J. Combin. Theory Ser. B 100 332–346.Google Scholar
Han, J. and Zhao, Y. (2015) Minimum codegree threshold for Hamilton $\ell$ -cycles in k-uniform hypergraphs. J. Combin. Theory Ser. A 132 194–223.Google Scholar
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience.CrossRefGoogle Scholar
Katona, G. Y. and Kierstead, H. A. (1999) Hamiltonian chains in hypergraphs. J. Graph Theory 30 205–212.3.0.CO;2-O>CrossRefGoogle Scholar
Keevash, P., Kühn, D., Mycroft, R. and Osthus, D. (2011) Loose Hamilton cycles in hypergraphs. Discrete Math. 311 544–559.Google Scholar
Kühn, D., Mycroft, R. and Osthus, D. (2010) Hamilton $\ell$ -cycles in uniform hypergraphs. J. Combin. Theory Ser. A 117 910–927.Google Scholar
Kühn, D. and Osthus, D. (2006) Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96 767–821.Google Scholar
Kühn, D. and Osthus, D. (2006) Matchings in hypergraphs of large minimum degree. J. Graph Theory 51 269–280.CrossRefGoogle Scholar
Kühn, D. and Osthus, D. (2014) Hamilton cycles in graphs and hypergraphs: an extremal perspective. In Proceedings of the International Congress of Mathematicians (Seoul 2014), Vol. IV, pp. 381–406. Kyung Moon Sa, Seoul.Google Scholar
Levin, D. A. and Peres, Y. (2017) Markov Chains and Mixing Times, American Mathematical Society.CrossRefGoogle Scholar
Reiher, C., Rödl, V., Ruciński, A., Schacht, M. and Szemerédi, E. (2019) Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Proc. Lond. Math. Soc. 119 409–439.Google Scholar
Rödl, V. and Ruciński, A. (2010) Dirac-Type questions for hypergraphs: a survey (or more problems for Endre to solve). In An Irregular Mind, pp. 561–590. Springer.CrossRefGoogle Scholar
Rödl, V., Ruciński, A. and Szemerédi, E. (2006) A Dirac-Type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15 229–251.Google Scholar
Rödl, V., Ruciński, A. and Szemerédi, E. (2008) An approximate Dirac-Type theorem for k-uniform hypergraphs. Combinatorica 28 229–260.CrossRefGoogle Scholar
Rödl, V., Ruciński, A. and Szemerédi, E. (2009) Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory Ser. A 116 613–636.Google Scholar
Rödl, V., Ruciński, A. and Szemerédi, E. (2011) Dirac-Type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Adv. Math. 227 1225–1299.Google Scholar
Sárközy, G. N., Selkow, S. M. and Szemerédi, E. (2003) On the number of Hamiltonian cycles in Dirac graphs. Discrete Math. 265 237–250.CrossRefGoogle Scholar
Zhao, Y. (2016) Recent advances on Dirac-Type problems for hypergraphs. In Recent Trends in Combinatorics, pp. 145–165. Springer.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 10 *
View data table for this chart

* Views captured on Cambridge Core between 17th December 2020 - 7th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Counting Hamilton cycles in Dirac hypergraphs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Counting Hamilton cycles in Dirac hypergraphs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Counting Hamilton cycles in Dirac hypergraphs
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *