Perfect Packings in Quasirandom Hypergraphs II

DOI10.1017/S0963548315000267MaRDI QIDQ5366906zbMATH OpenFDO

Authors John Lenz, Dhruv Mubayi

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)

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.

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

Cites work

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

Cited in

(8)

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