On the largest graph-Lagrangians of hypergraphs
On the largest graph-Lagrangians of hypergraphs
复制标题
DOI：
--
复制
发表时间：
2013-11
期刊：
影响因子：
--
通讯作者：
Qingsong Tang;Yuejian Peng;Xiangde Zhang;Cheng Zhao
中科院分区：
文献类型：
--
作者：
Qingsong Tang;Yuejian Peng;Xiangde Zhang;Cheng Zhao
Frankl和F‘uredi()猜想，在所有具有$m$边的$r$-图中，由取${\mathbb N}^{(R)}$的前$m$集组成的具有$m$边的$r$-图具有最大的图-拉格朗日.本文建立了一些支持这一猜想的特殊的$r$-图的图-拉格朗日的界.
Frankl and F\"uredi (1989) conjectured that the $r$-graph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\mathbb N}^{(r)}$ has the largest graph-Lagrangian of all $r$-graphs with $m$ edges. In this paper, we establish some bounds for graph-Lagrangians of some special $r$-graphs that support this conjecture.