Tiling multipartite hypergraphs in quasi-random hypergraphs

DOI10.1016/j.jctb.2022.12.005OpenAlexW4313593723MaRDI QIDQ2692780

Shumin Sun, Jie Han, Wenling Zhou, Lai-hao Ding, Guang-Hui Wang

Publication date: 23 March 2023

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

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

zbMATH Keywords

absorbing methodmultipartite hypergraphquasi-random hypergraph\(F\)-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• A problem of Erdős and Sós on 3-graphs
• Perfect packings in quasirandom hypergraphs. I.
• Embedding tetrahedra into quasirandom hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• Blow-up lemma
• Hypergraphs, quasi-randomness, and conditions for regularity
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• On Ramsey - Turan type theorems for hypergraphs
• The complexity of perfect matchings and packings in dense hypergraphs
• \(F\)-factors in hypergraphs via absorption
• On extremal problems of graphs and generalized graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• σ-algebras for quasirandom hypergraphs
• Triangle factors of graphs without large independent sets and of weighted graphs
• Recent advances on Dirac-type problems for hypergraphs
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
• Weak quasi-randomness for uniform hypergraphs
• Quasi-random hypergraphs revisited
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Quasi-random hypergraphs
• Factors in random graphs
• Quasi‐random classes of hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• On Perfect Matchings and Tilings in Uniform Hypergraphs
• Some Remarks on π
• Regularity Lemma for k-uniform hypergraphs
• The bandwidth theorem for locally dense graphs
• The poset of hypergraph quasirandomness
• Perfect Packings in Quasirandom Hypergraphs II
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas
• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
• A geometric theory for hypergraph matching
• On the maximal number of independent circuits in a graph
• Quasi-random graphs
• Quasirandomness in hypergraphs

This page was built for publication: Tiling multipartite hypergraphs in quasi-random hypergraphs