Counting Hamilton cycles in Dirac hypergraphs

DOI10.1007/S00493-023-00029-4MaRDI QIDQ6081391zbMATH OpenOpenAlexFDO

Authors Asaf Ferber, Adva Mond

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00493-023-00029-4

zbMATH Keywords

counting problemsHamilton cycleshypergraphsminimum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Counting Hamilton cycles in Dirac hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs

Cited in

(2)

• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Counting spanning subgraphs in dense hypergraphs

This page was built for publication: Counting Hamilton cycles in Dirac hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081391)