This is a preview of subscription content, log in via an institution to check access.
References
N. Sauer: On the density of families of sets,J. Comb. Th. (A) 13 (1972), 145–147.
S. Shelah: A combinatorial problem,Pacific J. Math. 41 (1972), 247–261.
V. N. Vapnik, andA. J. Ĉervonenkis: The uniform convergence of frequencies of the apperance of events to their probabilities, (in Russian),Teor. Veroyatn. Primen.,16 (1971), 267–279.
P. Frankl, andJ. Pach: On disjointly representable sets, Combinatorica4 (1984), 39–45.
P. Frankl, andM. Watanabe: Density results for uniform families,Combinatorica 14 (1) (1994), 115–119.
P. Erdős: On some problems in graph theory, combinatorial analysis and combinatorial number theory, in:Graph theory and combinatorics (Cambridge, 1983), 1–17. B. Bollobás ed., Academic Press, London, 1984.
P. Erdős, C. Ko, andR. Rado: Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2)12 (1961), 313–320.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ahlswede, R., Khachatrian, L.H. Counterexample to the Frankl-Pach conjecture for uniform, dense families. Combinatorica 17, 299–301 (1997). https://doi.org/10.1007/BF01200912
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01200912