3-一致短线性路的Lagrange密度及其扩张的Turán数
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
摘要:
对于一个固定正整数$n$和一个$r$ -一致超图$H$,图兰数$ex(n,H)$是无$H$的$r$ -一致超图中$n$顶点上的最大边数,$H$的拉格朗日密度定义为$π_λ(H)=\sup \{r! λ(G) : G \;\text{is an}\; H\text{-free} \;r\text{-uniform hypergraph}\}$,其中$λ(G)$是$G$的拉格朗日.对于一个$r$ -一致超图$H$在$t$的顶点上,显然$π_λ(H)\ge r!λ{(K_{t-1}^r)}$ .我们称$r$ -一致超图$H$是完美的,如果$π_λ(H)= r!λ{(K_{t-1}^r)}$ .令$P_t=\{e_1, e_2, \dots, e_t\}$为长度为$t$的线性$3$ -均匀路径,即,如果$|i-j|\ge 2$,则为$|e_i|=3$、$|e_i \cap e_{i+1}|=1$和$e_i \cap e_j=\emptyset$。我们证明了$P_3$和$P_4$是完美的,这支持了\cite{yanpeng}中的一个猜想,即所有的$3$ -一致线性超图都是完美的.应用拉格朗日密度的结果,我们确定了它们的扩张的图兰数。
英文摘要:
For a fixed positive integer $n$ and an $r$-uniform hypergraph $H$, the Turán 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 $π_λ(H)=\sup \{r! λ(G) : G \;\text{is an}\; H\text{-free} \;r\text{-uniform hypergraph}\}$, where $λ(G)$ is the Lagrangian of $G$. For an $r$-uniform hypergraph $H$ on $t$ vertices, it is clear that $π_λ(H)\ge r!λ{(K_{t-1}^r)}$. We say that an $r$-uniform hypergraph $H$ on $t$ vertices is perfect if $π_λ(H)= r!λ{(K_{t-1}^r)}$. Let $P_t=\{e_1, e_2, \dots, e_t\}$ be the linear $3$-uniform path of length $t$, that is, $|e_i|=3$, $|e_i \cap e_{i+1}|=1$ and $e_i \cap e_j=\emptyset$ if $|i-j|\ge 2$. We show that $P_3$ and $P_4$ 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án numbers of their extensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。