English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 thatevery 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 andOsthus 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 integersn 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' ofR\"odl, Ruci\'nski and Szemer\'edi.

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