Tiling 3-Uniform Hypergraphs With K43-2e

  title={Tiling 3-Uniform Hypergraphs With K43-2e},
  author={Andrzej Czygrinow and Louis DeBiasio and Brendan Nagle},
  journal={Journal of Graph Theory},
Let K 3 4 − 2e denote the hypergraph consisting of two triples on four points. For an integer n, let t (n, K 3 4 − 2e) denote the smallest integer d so that every 3-uniform hypergraph G of order n with minimum pairdegree δ2(G) ≥ d contains n/4 vertex-disjoint copies of K 3 4 − 2e. Kühn and Osthus (J Combin Theory, Ser B 96(6) (2006), 767–821) proved that t (n, K 3 4 − 2e) = 4 (1 + o(1)) holds for large integers n. Here, we prove the ∗ The third author was partially supported by NSF grant DMS… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
10 Citations
11 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 11 references

A geometric theory for hypergraph matching

  • P. Keevash, R. Mycroft
  • Available at http://arxiv.org/abs/1108.1757 arXiv…
  • 2011
2 Excerpts

Proof of the Erdos-Faudree conjecture on quadrilaterals

  • H. Wang
  • Graphs Combin 26
  • 2010
2 Excerpts

Proof of a conjecture of P

  • A. Hajnal, E. Szemerédi
  • Erdős, In: Combinatorial Theory and its…
  • 1970
1 Excerpt

Similar Papers

Loading similar papers…