Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

DOI10.1016/J.JCTA.2017.02.003zbMath1358.05070arXiv1503.08730OpenAlexW830927343MaRDI QIDQ516075

Jie Han, Chuanyun Zang, Yi Zhao

Publication date: 20 March 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08730

zbMATH Keywords

hypergraphregularity lemmaabsorbing methodgraph packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (17)

Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Graph Tilings in Incompatibility Systems ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Covering and tiling hypergraphs with tight cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Exact Minimum Codegree Threshold for K⁻₄-Factors ⋮ Covering and tiling hypergraphs with tight cycles ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering

Cites Work

• 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
• 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
• 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
• \(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
• Codegree Thresholds for Covering 3-Uniform Hypergraphs
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• Tiling 3-Uniform Hypergraphs With K43−2e
• Recent advances on Dirac-type problems for hypergraphs
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Embedding large subgraphs into dense graphs
• Minimum Vertex Degree Threshold for ‐tiling*
• A geometric theory for hypergraph matching
• Proof of the Alon-Yuster conjecture

This page was built for publication: Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs