Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions

From MaRDI portal
Publication:2045366




Abstract: For a fixed positive integer n and an r-uniform hypergraph H, the Tur'an number ex(n,H) is the maximum number of edges in an H-free r-uniform hypergraph on n vertices, and the Lagrangian density of H is defined as pilambda(H)=supr!lambda(G):G;extisan;Hextfree;rextuniformhypergraph, where lambda(G) is the Lagrangian of G. For an r-uniform hypergraph H on t vertices, it is clear that pilambda(H)ger!lambda(Kt1r). We say that an r-uniform hypergraph H on t vertices is perfect if pilambda(H)=r!lambda(Kt1r). Let Pt=e1,e2,dots,et be the linear 3-uniform path of length t, that is, |ei|=3, |eicapei+1|=1 and eicapej=emptyset if |ij|ge2. We show that P3 and P4 are perfect, this supports a conjecture in cite{yanpeng} proposing that all 3-uniform linear hypergraphs are perfect. Applying the results on Lagrangian densities, we determine the Tur'an numbers of their extensions.









This page was built for publication: Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions

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