Abstract
We prove that the vertex degree threshold for tiling C43 (the 3-uniform hypergraph with four vertices and two triples) in a 3-uniform hypergraph on n 4N vertices is n-12-34n2+38n+c, where c=1 if n 8N and c=-12 otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling.
| Original language | English |
|---|---|
| Pages (from-to) | 300-317 |
| Number of pages | 18 |
| Journal | Journal of Graph Theory |
| Volume | 79 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Aug 2015 |
| Externally published | Yes |
Keywords
- 05C65
- 2000 Mathematics Subject Classification: 05C70
- absorbing method
- graph packing
- hypergraph
- regularity lemma