1 |
P. Turan, On an extremal problem in graph theory, Mat. Fiz. Lapok. 48 (1941), 436-452.
|
2 |
I. M. Bomze, Evolution towards the maximum clique, J. Global Optim. 10 (1997), no. 2, 143-164.
DOI
|
3 |
M. Budinich, Exact bounds on the order of the maximum clique of a graph, Discrete Appl. Math. 127 (2003), no. 3, 535-543.
DOI
|
4 |
S. R. Bulo and M. Pelillo, A continuous characterization of maximal cliques in k-uniform hypergraphs, In: V. Maniezzo, R. Battiti, J. P. Watson(Eds.): Lecture Notes in Comput. Sci., vol. 5313, pp. 220-233. Spring, New York, 2008.
|
5 |
S. R. Bulo and M. Pelillo, A generalization of the Motzkin-Straus theorem to hypergraphs, Optim. Lett. 3 (2009), no. 2, 287-295.
DOI
|
6 |
S. R. Bulo, A. Torsello, and M. Pelillo, A continuous-based approach for partial clique enumeration, In: F. Escolano, M. Vento (Eds.): Lecture Notes in Comput. Sci., vol. 4538, pp. 61-70. Spring, New York, 2007.
|
7 |
P. Frankl and Z. Furedi, Extremal problems whose solutions are the blowups of the small Witt-designs, J. Combin. Theory Ser. A 52 (1989), no. 1, 129-147.
DOI
|
8 |
P. Frankl and V. Rodl, Hypergraphs do not jump, Combinatorica 4 (1984), no. 2-3, 149-159.
DOI
|
9 |
A. F. Sidorenko, On the maximal number of edges in a homogeneous hypergraph that does not contain prohibited subgraphs, Mat. Zametki. 41 (1987), no. 3, 433-455.
|
10 |
Y. Peng and C. Zhao, A Motzkin-Straus type result for 3-uniform hypergraphs, Graphs Combin. 29 (2013), no. 3, 681-694.
DOI
|
11 |
V. T. Sos and E. G. Straus, Extremals of functions on graphs with applications to graphs and hypergraphs, J. Combin. Theory Ser. B 32 (1982), no. 3, 246-257.
DOI
|
12 |
Q. Tang, H. Peng, C. Wang, and Y. Peng, On Frankl and Furedi's conjecture for 3- uniform hypergraphs, Acta Math. Appl. Sin. Engl. Ser. 32 (2016), no. 1, 95-112.
DOI
|
13 |
Q. Tang, Y. Peng, X. Zhang, and C. Zhao, On the graph-Lagrangians of 3-uniform hypergraphs containing dense subgraphs, J. Optim. Theory Appl. 163 (2014), no. 1, 31-56.
DOI
|
14 |
Q. Tang, Y. Peng, X. Zhang, and C. Zhao, Connection between the clique number and the Lagrangian of 3-uniform hypergraphs, Optimization Lett. 10 (2016), no. 4, 685-697.
DOI
|
15 |
T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turan, Canad. J. Math. 17 (1965), 533-540.
DOI
|
16 |
L. E. Gibbons, D. W. Hearn, P. M. Pardalos, and M. V. Ramana, Continuous characterizations of the maximum clique problem, Math. Oper. Res. 22 (1997), no. 3, 754-768.
DOI
|
17 |
R. Gu, X. Li, Y. Peng, and Y. Shi, Some Motzkin-Straus type results for non-uniform hypergraphs, J. Comb. Optim. 31 (2016), no. 1, 223-238.
DOI
|
18 |
X. Lu and X. Zhang, A note on Lagrangians of 4-uniform hypergraphs, Ars Combin. 121 (2015), 329-340.
|
19 |
D. Mubayi, A hypergraph extension of Turan's theorem, J. Combin. Theory Ser. B 96 (2006), no. 1, 122-134.
DOI
|
20 |
P. M. Pardalos and A. Phillips, A global optimization approach for solving the maximum clique problem, Int. J. Comput. Math. 33 (1990), 209-216.
DOI
|
21 |
S. Busygin, A new trust region technique for the maximum weight clique problem, Discrete Appl. Math. 154 (2006), no. 15, 2080-2096.
DOI
|
22 |
M. Pavan and M. Pelillo, Generalizing the Motzkin-Straus theorem to edge-weighted graphs, with applications to image segmentation, In: A. Rangarajan, M. A. T. Figueiredo, J. Zerubia (Eds.): Lecture Notes in Comput. Sci., vol. 2683, pp. 485-500. Spring, New York, 2003,
|
23 |
Y. Peng, H. Peng, Q. Tang, and C. Zhao, An extension of Motzkin-Straus theorem to non-uniform hypergraphs and its applications, Discrete Appl. Math. 200 (2016), 170-175.
DOI
|
24 |
Y. Peng, Q. Tang, and C. Zhao, On Lagrangians of r-uniform hypergraphs, J. Comb. Optim. 30 (2015), no. 3, 812-825.
DOI
|