On Lagrangians of Hypergraphs and Cliques
Lecture Notes in Electrical Engineering（2012）
摘要
Motzkin and Straus establishes a remarkable connection between the maximum clique problem and the Lagrangian of a graph in [4]. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide evidence that the Lagrangian of a 3-uniform hypergraph is related to the size of its maximum cliques under some conditions. © 2012 Springer-Verlag GmbH.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要