Perfect Packings in Quasirandom Hypergraphs II

DOI10.1017/S0963548315000267zbMATH Open1372.05148arXiv1405.0065MaRDI QIDQ5366906FDOQ5366906

Authors: John Lenz, Dhruv Mubayi 

Publication date: 10 October 2017

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

Abstract: For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our general result for 3-uniform hypergraphs is as follows. Fix an integer r >= 4 and 0<p<1. Suppose that H is an n-vertex triple system with r|n and the following two properties: * for every graph G with V(G)=V(H), at least p proportion of the triangles in G are also edges of H, * for every vertex x of H, the link graph of x is a quasirandom graph with density at least p. Then H has a perfect $K_r^{(3)}$-packing. Moreover, we show that neither hypotheses above can be weakened, so in this sense our result is tight. A similar conclusion for this special case can be proved by Keevash's hypergraph blowup lemma, with a slightly stronger hypothesis on H.

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

Recommendations

• Perfect packings in quasirandom hypergraphs. I.
• Packing perfect matchings in random hypergraphs
• Packing random graphs and hypergraphs
• On perfect packings in dense graphs
• The complexity of perfect matchings and packings in dense hypergraphs
• Integer and fractional packings of hypergraphs
• scientific article; zbMATH DE number 1300357
• scientific article; zbMATH DE number 5665909
• Packings in complete graphs
• A note on packing of uniform hypergraphs

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)

Cites Work

• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• \(F\)-factors in hypergraphs via absorption
• Title not available (Why is that?)
• Proof of the Alon-Yuster conjecture
• Title not available (Why is that?)
• Quasi-random graphs
• 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
• Counting designs
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• Matchings in 3-uniform hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Eigenvalues of non-regular linear quasirandom hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Perfect matchings in 3-uniform hypergraphs with large vertex degree
• Tiling 3-uniform hypergraphs with \(K_4^3-2e\)
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• Title not available (Why is that?)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• The poset of hypergraph quasirandomness
• Eigenvalues and linear quasirandom hypergraphs
• A geometric theory for hypergraph matching
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Perfect matchings in 4-uniform hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• σ-algebras for quasirandom hypergraphs
• A hypergraph blow-up lemma
• Weak quasi-randomness for uniform hypergraphs
• Quasi-random hypergraphs revisited
• Quasi-random hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• Quasi‐random classes of hypergraphs
• Quasi-Random Set Systems
• Cohomological Aspects of Hypergraphs
• The quasi-randomness of hypergraph cut properties
• Hereditary quasirandom properties of hypergraphs

Cited In (8)

• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
• Packing random graphs and hypergraphs
• Embedding tetrahedra into quasirandom hypergraphs
• Short paths in quasi-random triple systems with sparse underlying graphs
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• F$F$‐factors in Quasi‐random Hypergraphs

This page was built for publication: Perfect Packings in Quasirandom Hypergraphs II

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