Perfect Packings in Quasirandom Hypergraphs II

DOI10.1017/S0963548315000267zbMath1372.05148arXiv1405.0065MaRDI QIDQ5366906

Dhruv Mubayi, John Lenz

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Packing \(k\)-partite \(k\)-uniform hypergraphs, F$F$‐factors in Quasi‐random Hypergraphs, Tiling multipartite hypergraphs in quasi-random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect packings in quasirandom hypergraphs. I.
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Hereditary quasirandom properties of hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Perfect matchings in 4-uniform hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Blow-up lemma
• Hypergraphs, quasi-randomness, and conditions for regularity
• Counting designs
• \(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
• Eigenvalues of non-regular linear quasirandom hypergraphs
• Fractional and integer matchings in uniform hypergraphs
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• Tiling 3-Uniform Hypergraphs With K43−2e
• σ-algebras for quasirandom hypergraphs
• A hypergraph blow-up lemma
• Weak quasi-randomness for uniform hypergraphs
• Quasi-random hypergraphs revisited
• The quasi-randomness of hypergraph cut properties
• Quasi-random hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Quasi‐random classes of hypergraphs
• Cohomological Aspects of Hypergraphs
• Quasi-Random Set Systems
• The poset of hypergraph quasirandomness
• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
• A geometric theory for hypergraph matching
• Quasi-random graphs
• Proof of the Alon-Yuster conjecture