On Lagrangians of Hypergraphs and Cliques

摘要

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.