Péter Frankl

9.8k citations
297 papers · 6.8k · 2 hit papers · h-index 42

Impact in

Papers in

Péter Frankl

271 papers receiving 6.2k citations

Péter Frankl's Hit Papers

Families of finite sets in which no set is covered by the union ofr others 1985 · 361 citations
3610+15+30Years since publication100200300

Peers

Péter Frankl
Comparison fields: 5 of 59
  • Discrete Mathematics and Combinatorics 5k
  • Computational Theory and Mathematics 1.3k
  • Artificial Intelligence 834
  • Algebra and Number Theory 101
  • Geometry and Topology 167
Replace Zoltán Füredi with:
Zoltán Füredi Hungary
Benny Sudakov United States
János Komlós United States
Gil Kalai Israel
Jeff Kahn United States
Michael Krivelevich Israel
Vera T. Sós Hungary
Jacobus H. Lint Netherlands
Alexander I. Barvinok United States
Helmut Prodinger South Africa
Péter Frankl relative to Zoltán Füredi Hungary Zoltán Füredi's profile →
Citations per field
00.5×1.7×
Zoltán Füredi · 1×
Citations per year

Countries citing papers authored by Péter Frankl

Since Specialization
Citations

This map shows the geographic impact of Péter Frankl's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Péter Frankl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Péter Frankl more than expected).

Fields of papers citing papers by Péter Frankl

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Péter Frankl. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Péter Frankl. The network helps show where Péter Frankl may publish in the future.

Co-authors

The 25 scholars most cited alongside Péter Frankl, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Péter Frankl Line = papers co-authored together Péter Frankl links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 297 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Intersection theorems with geometric consequences
Hit paper breakdown →
1981380
2
Families of finite sets in which no set is covered by the union ofr others
Hit paper breakdown →
1985361
3 1986230
4 1988207
5 1986206
6 1986174
7 1977168
8 1982137
9 1985132
10 1987129
11 2002112
12 1982110
13 1983110
14 1986103
15 198499
16 198690
17 198787
18 197886
19 201384
20 198383

About Péter Frankl

Péter Frankl is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Applied Mathematics and Artificial Intelligence, having authored 297 papers that have together received 6.8k indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (205 papers), Limits and Structures in Graph Theory (139 papers), Advanced Graph Theory Research (11 papers), Finite Group Theory Research (9 papers), Coding theory and cryptography (9 papers), Point processes and geometric inequalities (7 papers), Complexity and Algorithms in Graphs (6 papers) and Mathematics and Applications (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (5k citations), Computational Theory and Mathematics (1.3k citations), Artificial Intelligence (834 citations), Algebra and Number Theory (101 citations) and Geometry and Topology (167 citations). Péter Frankl has collaborated with scholars based in Hungary, France and United States. Frequent co-authors include Zoltán Füredi, Vojtch Rödl, Vojtěch Rödl, R. Wilson, Paul L. Erdos, Norihide Tokushige, Hiroshi Maehara, Michel Marie Deza, László Babai and Ron L. Graham. Their work appears in journals such as Journal of Combinatorial Theory Series A, European Journal of Combinatorics, COMBINATORICA, Discrete Mathematics and Journal of Combinatorial Theory Series B.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact