arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.2855math.CO
收藏

关于超图拉格朗日量

On hypergraph Lagrangians

Qingsong Tang, Xiaojun Lu, Xiangde Zhang, Cheng Zhao

摘要:

Frankl和Füredi猜测,通过取${\mathbb N}^{(r)}$的Colex排序中的第一个$m$集合而形成的具有$m$边的$r$-均匀超图具有所有$r$ -在\cite{FF}中具有$m$边的最大拉格朗日量。Motzkin和Straus的定理证实了这个猜想时,$r=2$。对于$r=3$,Talbot在\cite{T}中证明,当$m$在一定范围内时,该猜想成立。本文研究了$r$ -一致超图的团数与拉格朗日量之间的关系。作为这一联系的一个推论,我们证明了由第一个$m$集按${\mathbb N}^{(r)}$的colex序构成的具有$m$边的$r$ -一致超图在所有具有满足${t-1\choose r}\leq m \leq {t-1\choose r}+ {t-2\choose r-1}-[(2r-6)\times2^{r-1}+2^{r-3}+(r-4)(2r-7)-1]({t-2\choose r-2}-1)$(对于$r\geq 4.$)的$r$ -一致图中具有最大的拉格朗日

英文摘要:

It is conjectured by Frankl and Füredi that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform hypergraphs with $m$ edges in \cite{FF}. Motzkin and Straus' theorem confirms this conjecture when $r=2$. For $r=3$, it is shown by Talbot in \cite{T} that this conjecture is true when $m$ is in certain ranges. In this paper, we explore the connection between the clique number and Lagrangians for $r$-uniform hypergraphs. As an implication of this connection, we prove that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform graphs with $t$ vertices and $m$ edges satisfying ${t-1\choose r}\leq m \leq {t-1\choose r}+ {t-2\choose r-1}-[(2r-6)\times2^{r-1}+2^{r-3}+(r-4)(2r-7)-1]({t-2\choose r-2}-1)$ for $r\geq 4.$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑