On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.

Motzkin and Straus established a remarkable connection between the maximum clique and the Graph-Lagrangian of a graph in (Can. J. Math. 17:533-540, ). This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide upper bounds on the Graph-Lagrangian of a hypergraph containing dense subgraphs when the number of edges of the hypergraph is in certain ranges. These results support a pair of conjectures introduced by Peng and Zhao (Graphs Comb. 29:681-694, ) and extend a result of Talbot (Comb. Probab. Comput. 11:199-216, ). [ABSTRACT FROM AUTHOR]