On Cliques and Lagrangians of 3-uniform Hypergraphs

There is a remarkable connection between the maximum clique number and the Lagrangian of a graph given by T. S. Motzkin and E.G. Straus in 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 explore evidences that the Lagrangian of a 3-uniform hypergraph is related to the order of its maximum cliques when the number of edges of the hypergraph is in certain range. In particular, we present some results about a conjecture introduced by Y. Peng and C. Zhao (2012) and describe a combinatorial algorithm that can be used to check the validity of the conjecture.

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

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

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

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

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

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

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

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

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

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

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

[12]  Xiangde Zhang,et al.  Some results on Lagrangians of hypergraphs , 2014, Discret. Appl. Math..

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

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

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

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

[17]  Xiangde Zhang,et al.  On Lagrangians of Hypergraphs Containing Dense Subgraphs , 2013, 1311.1409.