Tiling 3-uniform hypergraphs with K_4^3-2e

Details Tiling 3-uniform hypergraphs with K_4^3-2e Tiling 3-uniform hypergraphs with K_4^3-2e

2011-08-20

arxiv.org/abs/1108.4140v2

Mathematics

Combinatorics

10 pages, 1 figure (fixed a typo)

Scientific paper

Let K_4^3-2e denote the hypergraph consisting of two triples on four points. For an integer n, let t(n, K_4^3-2e) denote the smallest integer d so that every 3-uniform hypergraph G of order n with minimum pair-degree \delta_2(G) \geq d contains \floor{n/4} vertex-disjoint copies of K_4^3-2e. K\"uhn and Osthus proved that t(n, K_4^3-2e) = (1 + o(1))n/4 holds for large integers n. Here, we prove the exact counterpart, that for all sufficiently large integers n divisible by 4, t(n, K_4^3-2e) = n/4 when n/4 is odd, and t(n, K_4^3-2e) = n/4+1 when n/4 is even. A main ingredient in our proof is the recent `absorption technique' of R\"odl, Ruci\'nski and Szemer\'edi.

Affiliated with

Also associated with

No associations

Rating

Tiling 3-uniform hypergraphs with K_4^3-2e does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tiling 3-uniform hypergraphs with K_4^3-2e, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tiling 3-uniform hypergraphs with K_4^3-2e will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244558