Large Y_{3,2} -tilings in 3-uniform hypergraphs

arXiv2304.02432MaRDI QIDQ6509537FDOQ6509537

Authors: Jie Han, Lin Sun, Guanghui Wang 

Abstract: Let $Y_{3,2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $H$ on $n$ vertices with at least $$ edges contains a $Y_{3,2}$-tiling covering more than $4alphan$ vertices, for sufficiently large $n$ and $0<alpha<1/4$. The bound on the number of edges is asymptotically best possible and solves a conjecture of the authors for 3-graphs that generalizes the Matching Conjecture of ErdH{o}s.

This page was built for publication: Large $ Y_{3,2} $-tilings in 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509537)