Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
From MaRDI portal
Publication:6046654
DOI10.1002/jgt.22853zbMath1522.05264arXiv2003.11686OpenAlexW4283207141MaRDI QIDQ6046654
No author found.
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.11686
Cites Work
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Recent trends in combinatorics
- Tight cycles and regular slices in dense hypergraphs
- Forbidding Hamilton cycles in uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- Forcing large tight components in 3-graphs
- Completion and deficiency problems
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- The complexity of perfect matchings and packings in dense hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- The Hamiltonian problem and \(t\)-path traceable graphs
- On extremal problems of graphs and generalized graphs
- Covering the vertices of a graph by vertex-disjoint paths
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Hamiltonian chains in hypergraphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Covering and tiling hypergraphs with tight cycles
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
This page was built for publication: Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
