Graphs and Combinatorics

, Volume 5, Issue 1, pp 295–299 | Cite as

Traces of antichains

  • P. Frankl
Research Problems


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N.: On the density of sets of vectors. Discrete Math.46, 199–202 (1983)Google Scholar
  2. 2.
    Erdös, P.: On a lemma of Littlewood and Offord. Bull. Amer. Math. Soc.,51, 898–202 (1945)Google Scholar
  3. 3.
    Frankl, P.: On the trace of finite sets. J. Comb. Theory (A)34, 41–45 (1983)Google Scholar
  4. 4.
    Frankl, P., Pach, J.: On the number of sets in a nullt-design. Europ. J. Comb.4, 21–23 (1983)Google Scholar
  5. 5.
    Sauer, N.: On the density of families of sets. J. Comb. Theory (A)13, 145–147 (1972)Google Scholar
  6. 6.
    Shelah, S.: A combinatorial problem; Stability and order for models and theories in infinity languages. Pacific J. Math.41, 247–261 (1972)Google Scholar
  7. 7.
    Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Math. Z.27, 544–548 (1928)Google Scholar
  8. 8.
    Vapnik, V.N., Cervonenkis, A.: The uniform convergence of frequencies of the appearance of events to their probabilities (in Russian). Teor. Veroyatn. Primen.16, 264–279 (1971)Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • P. Frankl
    • 1
  1. 1.CNRS, Quai: Anatole FranceParisFrance

Personalised recommendations