Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles

DOI10.37236/9061zbMath1442.05106OpenAlexW3083306962MaRDI QIDQ2195224

Xin Min Hou, Boyuan Liu, Yue Ma

Publication date: 8 September 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9061

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)

Related Items (1)

Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• Supersaturated graphs and hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Using Lovász local lemma in the space of random injections
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Covering and tiling hypergraphs with tight cycles
• A hypergraph extension of the bipartite Turán problem
• \(H\)-factors in dense graphs
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• The minimum degree threshold for perfect graph packings
• The complexity of perfect matchings and packings in dense hypergraphs
• \(F\)-factors in hypergraphs via absorption
• Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs
• Tiling 3-Uniform Hypergraphs With K43−2e
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• Embedding large subgraphs into dense graphs
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
• Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs
• Exact Minimum Codegree Threshold for K⁻₄-Factors
• A geometric theory for hypergraph matching
• On a problem of K. Zarankiewicz
• Proof of the Alon-Yuster conjecture

This page was built for publication: Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles