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, 1965). 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, 2013) and extend a result of Talbot (Comb. Probab. Comput. 11:199–216, 2002).

[1]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[2]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[3]  Vera T. Sós,et al.  Extremals of functions on graphs with applications to graphs and hypergraphs , 1982, J. Comb. Theory, Ser. B.

[4]  Vojtech Rödl,et al.  Hypergraphs do not jump , 1984, Comb..

[5]  Zoltán Füredi,et al.  Extremal problems whose solutions are the blowups of the small witt-designs , 1989, J. Comb. Theory, Ser. A.

[6]  P. Pardalos,et al.  A global optimization approach for solving the maximum clique problem , 1990 .

[7]  Panos M. Pardalos,et al.  Continuous Characterizations of the Maximum Clique Problem , 1997, Math. Oper. Res..

[8]  Immanuel M. Bomze,et al.  Evolution towards the Maximum Clique , 1997, J. Glob. Optim..

[9]  John M. Talbot.  Lagrangians Of Hypergraphs , 2002, Comb. Probab. Comput..

[10]  Marco Budinich.  Exact Bounds on the Order of the Maximum Clique of a Graph , 2003, Discret. Appl. Math..

[11]  Marcello Pelillo,et al.  Generalizing the Motzkin-Straus Theorem to Edge-Weighted Graphs, with Applications to Image Segmentation , 2003, EMMCVPR.

[12]  Stanislav Busygin,et al.  A new trust region technique for the maximum weight clique problem , 2006, Discret. Appl. Math..

[13]  Dhruv Mubayi,et al.  A hypergraph extension of Turán's theorem , 2006, J. Comb. Theory, Ser. B.

[14]  Andrea Torsello,et al.  A Continuous-Based Approach for Partial Clique Enumeration , 2007, GbRPR.

[15]  Marcello Pelillo,et al.  A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs , 2008, LION.

[16]  Marcello Pelillo,et al.  A generalization of the Motzkin–Straus theorem to hypergraphs , 2009, Optim. Lett..

[17]  Yuejian Peng,et al.  On Cliques and Lagrangians of 3-uniform Hypergraphs , 2012 .

[18]  Yuejian Peng,et al.  A Motzkin–Straus Type Result for 3-Uniform Hypergraphs , 2013, Graphs Comb..

[19]  Yuejian Peng,et al.  On Lagrangians of r-uniform hypergraphs , 2015, J. Comb. Optim..