Journal of Combinatorial Optimization

, Volume 35, Issue 2, pp 588–612 | Cite as

Two extremal problems related to orders



We consider two extremal problems related to total orders on all subsets of \({\mathbb N}\). The first one is to maximize the Lagrangian of hypergraphs among all hypergraphs with m edges for a given positive integer m. In 1980’s, Frankl and Füredi conjectured that for a given positive integer m, the r-uniform hypergraph with m edges formed by taking the first m r-subsets of \({\mathbb N}\) in the colex order has the largest Lagrangian among all r-uniform hypergraphs with m edges. We provide some partial results for 4-uniform hypergraphs to this conjecture. The second one is for a given positive integer m, how to minimize the cardinality of the union closure families generated by edge sets of the r-uniform hypergraphs with m edges. Leck, Roberts and Simpson conjectured that the union closure family generated by the first m r-subsets of \({\mathbb N}\) in order U has the minimum cardinality among all the union closure families generated by edge sets of the r-uniform hypergraphs with m edges. They showed that the conjecture is true for graphs. We show that a similar result holds for non-uniform hypergraphs whose edges contain 1 or 2 vertices.


Colex order Order U Union-closure Lagrangian of hypergraphs 



We thank the reviewers for reading the manuscript carefully, checking the details and giving insightful comments to help improve the manuscript.


  1. Frankl P, Füredi Z (1989) Extremal problems whose solutions are the blow-ups of the small Witt-designs. J Comb Theory 52:129–147CrossRefMATHGoogle Scholar
  2. Frankl P, Rödl V (1984) Hypergraphs do not jump. Combinatorica 4:149–159MathSciNetCrossRefMATHGoogle Scholar
  3. He S, Li Z, Zhang S (2010) Approximation algorithms for homogenous polynomial optimization with quadratic constraints. Math Program Ser B 125:353–383CrossRefMATHGoogle Scholar
  4. Keevash P (2011) Hypergrah Turán problems, surveys in combinatorics. Cambridge University Press, Cambridge, pp 83–140MATHGoogle Scholar
  5. Kim H (2011) The union closure method for testing a fixed sequence of families of hypotheses. Biometrika 98:391–401MathSciNetCrossRefMATHGoogle Scholar
  6. Leck U, Roberts I, Simpson J (2012) Minimizing the weight of the union-closure of families of two-sets. Australas J Combin 52:67–73MathSciNetMATHGoogle Scholar
  7. Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turán. Can J Math 17:533–540CrossRefMATHGoogle Scholar
  8. Sidorenko AF (1987) Solution of a problem of Bollobas on 4-graphs. Mat Zametki 41:433–455MathSciNetGoogle Scholar
  9. Sun YP, Tang QS, Zhao C, Peng Y (2014) On the largest graph-Lagrangian of 3-graphs with fixed number of edges. J Optim Theory Appl 163(1):57–79MathSciNetCrossRefMATHGoogle Scholar
  10. Tang QS, Peng H, Wang C, Peng Y (2016) On Frankl and Füredi’s conjecture for 3-uniform hypergraphs. Acta Math Appl Sin English Ser 32(1):95–112MathSciNetCrossRefMATHGoogle Scholar
  11. Tang QS, Peng Y, Zhang XD, Zhao C (2014) Some results on Lagrangians of hypergraphs. Discrete Appl Math 166:222–238MathSciNetCrossRefMATHGoogle Scholar
  12. Tang QS, Peng Y, Zhang XD, Zhao C (2016) Connection between the clique number and the Lagrangian of 3-uniform hypergraphs. Optim Lett 10(4):685–697MathSciNetCrossRefMATHGoogle Scholar
  13. Talbot J (2002) Lagrangians of hypergraphs. Combin Probab Comput 11:199–216MathSciNetCrossRefMATHGoogle Scholar
  14. Turán P (1941) On an extremal problem in graph theory (in Hungarian). Mat Fiz Lapok 48:436–452MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of MathematicsHunan Normal UniversityChangshaPeople’s Republic of China
  2. 2.Institute of MathematicsHunan UniversityChangshaPeople’s Republic of China

Personalised recommendations