A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs

DOI10.1016/J.DISC.2022.113120zbMath1502.05035arXiv2110.12424OpenAlexW4293066497WikidataQ114190466 ScholiaQ114190466MaRDI QIDQ2092337

Jian Wang

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.12424

zbMATH Keywords

probabilistic methodconcentration inequalitiesDirac-type resultminimum \(d\)-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• On Hamiltonian bipartite graphs
• Recent advances on Dirac-type problems for hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Some Theorems on Abstract Graphs

This page was built for publication: A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs