Lagrangian densities of hypergraph cycles

MaRDI QIDQ6309016zbMATH OpenFDO

Authors Yuejian Peng, Zilong Yan

Publication date 30 October 2018

Abstract: The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $p{i}_{lambda}(H)ger!lambda(K_{t-1}^r)$. We say that an $r$-unform hypergraph $H$ with $t$ vertices is perfect if $p{i}_{lambda}(H)=r!lambda(K_{t-1}^r)$. A theorem of Motzkin-Straus implies that all $2$-uniform graphs are perfect. It is interesting to explore what kind of hypergraphs are perfect. A hypergraph is linear if any 2 edges have at most 1 vertex in common. We propose the following conjecture: (1) For $rge3$, there exists $n$ such that a linear $r$-unofrm hypergraph with at least $n$ vertices is perfect. (2) For $rge3$, there exists $n$ such that if $G,H$ are perfect $r$-uniform hypergraphs with at least $n$ vertices, then $$ is perfect. Regarding this conjecture, we obtain a partial result: Let $S_{2,t}=123,124,125,126,\mathrm{...},12(t+2)$. (An earlier result of Sidorenko states that $S_{2,t}$ is perfect cite{Sidorenko-89}.) Let $H$ be a perfect $3$-graph with $s$ vertices. Then $$ is perfect if $sgeq3$ and $tgeq3$.

This page was built for publication: Lagrangian densities of hypergraph cycles

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