Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
From MaRDI portal
Publication:6621258
Mathias Schacht, Vojtěch Rödl, Andrzej Ruciński, Bjarne Schülke, Christian Reiher
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Forbidding Hamilton cycles in uniform hypergraphs
- On extremal problems of graphs and generalized graphs
- Families of triples with high minimum degree are Hamiltonian
- Recent advances on Dirac-type problems for hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Some Theorems on Abstract Graphs
This page was built for publication: Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621258)
