Minimum Vertex Degree Threshold for ‐tiling*
From MaRDI portal
Publication:5265336
DOI10.1002/jgt.21833zbMath1317.05149arXiv1309.2200OpenAlexW1505016730MaRDI QIDQ5265336
Publication date: 23 July 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2200
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Cites Work
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- 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
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Tiling 3-Uniform Hypergraphs With K43−2e
- Extremal problems on set systems
- Regular Partitions of Hypergraphs: Regularity Lemmas
- A geometric theory for hypergraph matching
- Proof of the Alon-Yuster conjecture
This page was built for publication: Minimum Vertex Degree Threshold for ‐tiling*
