|
|||||
|
|
Minimum Vertex Degree Threshold for ‐tiling* |
|
| Authors: | Jie Han Yi Zhao |
| Institution: | DEPARTMENT OF MATHEMATICS AND STATISTICS, GEORGIA STATE UNIVERSITY, ATLANTA, GA |
| Abstract: | We prove that the vertex degree threshold for tiling  (the 3‐uniform hypergraph with four vertices and two triples) in a 3‐uniform hypergraph on  vertices is  , where  if  and  otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling. |
| Keywords: | graph packing hypergraph absorbing method regularity lemma 2000 Mathematics Subject Classification: 05C70 05C65 |