| Intersection theorems with geometric consequences P Frankl, RM Wilson Combinatorica 1 (4), 357-368, 1981 | 526 | 1981 |
| Families of finite sets in which no set is covered by the union ofr others P Erdös, P Frankl, Z Füredi Israel Journal of Mathematics 51 (1), 79-89, 1985 | 504* | 1985 |
| Complexity classes in communication complexity theory L Babai, P Frankl, J Simon 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 337-347, 1986 | 371 | 1986 |
| The Johnson-Lindenstrauss lemma and the sphericity of some graphs P Frankl, H Maehara Journal of Combinatorial Theory, Series B 44 (3), 355-362, 1988 | 305 | 1988 |
| Linear Algebra Methods in Combinatorics: With Applications to Geometry and Computer Science L Babai, P Frankl Department of Computer Science, univ. of Chicag, 1992 | 289 | 1992 |
| The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent P Erdös, P Frankl, V Rödl Graphs and Combinatorics 2 (1), 113-121, 1986 | 249 | 1986 |
| Some intersection theorems for ordered sets and graphs FRK Chung, RL Graham, P Frankl, JB Shearer Journal of Combinatorial Theory, Series A 43 (1), 23-37, 1986 | 237 | 1986 |
| On the maximum number of permutations with given maximal or minimal distance P Frankl, M Deza Journal of Combinatorial Theory, Series A 22 (3), 352-360, 1977 | 219 | 1977 |
| Forbidden intersections P Frankl, V Rödl Transactions of the American Mathematical Society 300 (1), 259-286, 1987 | 216 | 1987 |
| The shifting technique in extremal set theory P Frankl Surveys in combinatorics 123, 81-110, 1987 | 198 | 1987 |
| Extremal problems on set systems P Frankl, V Rödl Random Structures & Algorithms 20 (2), 131-164, 2002 | 182 | 2002 |
| An extremal problem for two families of sets P Frankl European Journal of Combinatorics 3 (2), 125-127, 1982 | 177 | 1982 |
| The Erdos-Ko-Rado theorem is true for n= ckt P Frankl Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) 1, 365-375, 1978 | 177 | 1978 |
| Erdös–Ko–Rado theorem—22 years later M Deza, P Frankl SIAM Journal on Algebraic Discrete Methods 4 (4), 419-431, 1983 | 173 | 1983 |
| Near perfect coverings in graphs and hypergraphs P Frankl, V Rödl European Journal of Combinatorics 6 (4), 317-326, 1985 | 153 | 1985 |
| The Erdös-Ko-Rado theorem for vector spaces P Frankl, RM Wilson Journal of Combinatorial Theory, Series A 43 (2), 228-236, 1986 | 143 | 1986 |
| Cops and robbers in graphs with large girth and Cayley graphs P Frankl Discrete Applied Mathematics 17 (3), 301-305, 1987 | 141 | 1987 |
| Hypergraphs do not jump P Frankl, V Rödl Combinatorica 4 (2-3), 149-159, 1984 | 126 | 1984 |
| The chromatic number of Kneser hypergraphs N Alon, P Frankl, L Lovász Transactions of the American Mathematical Society 298 (1), 359-370, 1986 | 120 | 1986 |
| Geometrical realization of set systems and probabilistic communication complexity N Alon, P Frankl, V Rodl 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 277-280, 1985 | 106 | 1985 |