Peter Frankl

Cited by

	All	Since 2018
Citations	12801	4377
h-index	56	35
i10-index	185	106

860

430

215

645

19851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202378 90 109 95 105 96 89 93 102 124 138 137 152 127 153 138 180 193 181 223 260 300 332 348 349 379 378 425 520 482 433 599 587 719 627 630 722 809 850

Public access

View all

28 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Zoltan FurediVerified email at illinois.edu
Andrey KupavskiiMoscow Institute of Physics and TechnologyVerified email at mipt.ru
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoVerified email at ucsd.edu
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Paul ErdősMathematics
Janos PachEcole Polytechnique Federale de Lausanne and Renyi Institute BudapestVerified email at renyi.hu
Gyula O.H. KatonaRenyi InstituteVerified email at renyi.hu
Hao HuangNational University of SingaporeVerified email at nus.edu.sg
James B. ShearerVerified email at alum.mit.edu
Navin SinghiSr. Professor, TIFR, Mumbai (retired)Verified email at math.tifr.res.in
Andrew OdlyzkoProfessor of Mathematics, University of MinnesotaVerified email at umn.edu
Richard StanleyMIT and University of MiamiVerified email at math.mit.edu
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
Benjamin SudakovETH, ZurichVerified email at math.ethz.ch
Imre BaranyProfessor of Mathematics, Renyi Institute, HungaryVerified email at renyi.hu
Gil KalaiProf. of Computer Science, The Interdisciplinary Center; Prof. of Mathematics, Hebrew U.Verified email at math.huji.ac.il

Peter Frankl

Hungarian Academy of Sciences

Verified email at renyi.mta.hu

Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Intersection theorems with geometric consequences P Frankl, RM Wilson Combinatorica 1, 357-368, 1981	673	1981
Families of finite sets in which no set is covered by the union of r others P Erdős, P Frankl, Z Füredi Israel J. Math 51 (1-2), 79-89, 1985	603*	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	465	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	392	1988
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	361	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	311	1986
Linear algebra methods in combinatorics: with applications to geometry and computer science L Babai, P Frankl Department of Computer Science, univ. of Chicag, 1992	310	1992
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	291	1977
The shifting technique in extremal set theory P Frankl Surveys in combinatorics 123, 81-110, 1987	276	1987
Forbidden intersections P Frankl, V Rödl Transactions of the American Mathematical Society 300 (1), 259-286, 1987	265	1987
An extremal problem for two families of sets P Frankl European Journal of Combinatorics 3 (2), 125-127, 1982	263	1982
The Erdos-Ko-Rado theorem is true for n= ckt P Frankl Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) 1, 365-375, 1978	237	1978
Extremal problems on set systems P Frankl, V Rödl Random Structures & Algorithms 20 (2), 131-164, 2002	215	2002
The Erdös-Ko-Rado theorem for vector spaces P Frankl, RM Wilson Journal of Combinatorial Theory, Series A 43 (2), 228-236, 1986	215	1986
Near perfect coverings in graphs and hypergraphs P Frankl, V Rödl European Journal of Combinatorics 6 (4), 317-326, 1985	209	1985
Cops and robbers in graphs with large girth and Cayley graphs P Frankl Discrete Applied Mathematics 17 (3), 301-305, 1987	208	1987
Erdös–Ko–Rado theorem—22 years later M Deza, P Frankl SIAM Journal on Algebraic Discrete Methods 4 (4), 419-431, 1983	203	1983
Hypergraphs do not jump P Frankl, V Rödl Combinatorica 4 (2-3), 149-159, 1984	169	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	152	1986
Large triangle-free subgraphs in graphs withoutK₄ P Frankl, V Rödl Graphs and Combinatorics 2 (1), 135-144, 1986	142	1986

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors