Tiling multipartite hypergraphs in quasi-random hypergraphs

DOI10.1016/J.JCTB.2022.12.005MaRDI QIDQ2692780zbMATH OpenOpenAlexFDO

Authors Jie Han, S. M. Sun, Wenling Zhou, Lai-hao Ding, Guanghui 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

\(F\)-factorabsorbing methodmultipartite hypergraphquasi-random hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Minimum codegree threshold for (K^3_4-e)-factors
• Factors in randomly perturbed hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Cites work

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

Cited in

(5)

• Tiling 3-uniform hypergraphs with K₄^3-2e
• The extremal function for partial bipartite tilings
• Factors in randomly perturbed hypergraphs
• FF‐factors in Quasi‐random Hypergraphs
• Tiling multipartite hypergraphs in Quasi-random Hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692780)