N. G. De-bruijn, C. Van-ebbenhorst, A. D. Tengbergen, and . Kruyswijk, On the set of divisors of a number, Nieuw Arch, Wiskundem, vol.23, pp.191-193, 1951.

C. Greene and D. J. Kleitman, Strong versions of Sperner's theorem, Journal of Combinatorial Theory, Series A, vol.20, issue.1, pp.80-88, 1976.
DOI : 10.1016/0097-3165(76)90079-0

J. R. Griggs, Sufficient Conditions for a Symmetric Chain Order, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.807-809, 1977.
DOI : 10.1137/0132068

J. R. Griggs, C. E. Killian, and A. C. Savage, Venn diagrams and symmetric chain decompositions in the Boolean lattice, Electronic J. Combinatorics, vol.11, issue.30, p.pp, 2004.

J. R. Griggs, W. Li, A. L. Lu, and D. Families, Diamond-free families, Journal of Combinatorial Theory, Series A, vol.119, issue.2, pp.310-322, 2012.
DOI : 10.1016/j.jcta.2011.09.002
URL : http://doi.org/10.1016/j.jcta.2011.09.002

D. Kleitman, A conjecture of Erd? os-Katona on commensurable pairs of subsets of an n-set, in Theory of Graphs, Proceedings of the Colloquium Held at Tihany, Hungary, pp.215-218, 1966.

D. Loeb, E. Damiani, and A. O. Antona, Decompositions of B n and ? n using symmetric chains, J. Combinatorial Theory (Ser. A), pp.65-151, 1994.

L. Lovász-and-m and . Simonovits, On the number of complete subgraphs of a graph II, Studies in pure mathematics, pp.459-495, 1983.

V. Nikiforov, The number of cliques in graphs of given order and size, Transactions of the American Mathematical Society, vol.363, issue.03, pp.1599-1618, 2011.
DOI : 10.1090/S0002-9947-2010-05189-X

A. Razborov, On the Minimal Density of Triangles in Graphs, Combinatorics, Probability and Computing, vol.15, issue.04, pp.603-618, 2008.
DOI : 10.2307/2310464

C. Reiher, The clique density problem. Seminar talk, 2011.

E. Sperner, Ein Satz ???ber Untermengen einer endlichen Menge, Mathematische Zeitschrift, vol.27, issue.1, pp.544-548, 1928.
DOI : 10.1007/BF01171114