Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs
From MaRDI portal
Publication:5366961
DOI10.1017/S0963548317000104zbMath1371.05202arXiv1508.05152OpenAlexW2963991599MaRDI QIDQ5366961
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05152
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ The degree and codegree threshold for linear triangle covering in 3-graphs ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- \(H\)-factors in dense graphs
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Matchings in 3-uniform hypergraphs
- The minimum degree threshold for perfect graph packings
- The complexity of perfect matchings and packings in dense hypergraphs
- \(F\)-factors in hypergraphs via absorption
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- On extremal problems of graphs and generalized graphs
- Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Tiling 3-Uniform Hypergraphs With K43−2e
- On the Complexity of General Graph Factor Problems
- A hypergraph blow-up lemma
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- Embedding large subgraphs into dense graphs
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Minimum Vertex Degree Threshold for ‐tiling*
- Near Perfect Matchings ink-Uniform Hypergraphs
- Exact Minimum Codegree Threshold for K−4-Factors
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- The Factorization of Linear Graphs
- Proof of the Alon-Yuster conjecture
This page was built for publication: Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs
