# Perfect Packings in Quasirandom Hypergraphs II

@article{Lenz2015PerfectPI, title={Perfect Packings in Quasirandom Hypergraphs II}, author={John Lenz and Dhruv Mubayi}, journal={Combinatorics, Probability and Computing}, year={2015}, volume={25}, pages={595 - 611} }

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…

## 4 Citations

### $F$-factors in Quasi-random Hypergraphs

- Mathematics
- 2021

Given k ≥ 2 and two k-graphs (k-uniform hypergraphs) F and H , an F -factor in H is a set of vertex disjoint copies of F that together covers the vertex set of H . Lenz and Mubayi [J. Combin. Theory…

### University of Birmingham Hamilton cycles in quasirandom hypergraphs

- Mathematics
- 2015

We show that, for a natural notion of quasirandomness in k -uniform hypergraphs, any quasirandom k -uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω( n k − 1 )…

### Hamilton cycles in quasirandom hypergraphs

- MathematicsRandom Struct. Algorithms
- 2016

It is shown that any quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω(nk-1) contains a loose Hamilton cycle.

## References

SHOWING 1-10 OF 60 REFERENCES

### Hereditary quasirandom properties of hypergraphs

- MathematicsComb.
- 2011

A natural extension of the result of Simonovits and Sós to k-uniform hypergraphs is given, answering a question of Conlon et al. and yields an alternative, and perhaps simpler, proof of one of their theorems.

### Sigma-Algebras for Quasirandom Hypergraphs

- Mathematics
- 2013

We examine the correspondence between the various notions of quasirandomness for k-uniform hypergraphs and sigma-algebras related to measurable hypergraphs. This gives a uniform formulation of most…

### A Geometric Theory for Hypergraph Matching

- Mathematics
- 2011

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two…

### Perfect matchings in large uniform hypergraphs with large minimum collective degree

- MathematicsJ. Comb. Theory, Ser. A
- 2009

### The minimum degree threshold for perfect graph packings

- MathematicsComb.
- 2009

The value of χ* (H) depends on the relative sizes of the colour classes in the optimal colourings of H and satisfies χ(H)−1 and the minimum degree of a graph G is determined.

### Perfect Matchings and K43-Tilings in Hypergraphs of Large Codegree

- MathematicsGraphs Comb.
- 2008

AbstractFor a k-graph F, let tl(n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least t edges contains a collection of…

### EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS

- MathematicsForum of Mathematics, Sigma
- 2015

Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous…