Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
From MaRDI portal
Publication:5237374
Recommendations
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Minimum degree conditions for tight Hamilton cycles
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
Cited in
(39)- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
- Hamiltonian paths and cycles in some 4-uniform hypergraphs
- Counting Hamilton cycles in Dirac hypergraphs
- A general approach to transversal versions of Dirac‐type theorems
- Embedding loose spanning trees in 3-uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Hamilton cycles in hypergraphs below the Dirac threshold
- On extremal hypergraphs for Hamiltonian cycles
- Hamiltonicity in cherry-quasirandom 3-graphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Resilience for tight Hamiltonicity
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- Optimal spread for spanning subgraphs of Dirac hypergraphs
- Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
- Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
- Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
- Minimum degree conditions for tight Hamilton cycles
- Decomposing hypergraphs into cycle factors
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Minimum degree ensuring that a hypergraph is Hamiltonian-connected
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
- Hamiltonicity in randomly perturbed hypergraphs
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- Transversal Hamilton cycle in hypergraph systems
- scientific article; zbMATH DE number 7448677 (Why is no real title available?)
- Tight cycles and regular slices in dense hypergraphs
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs
This page was built for publication: Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237374)
