Péter Frankl
Impact in
- Discrete Mathematics and Combinatorics top 0.05%
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
Papers in
-
- Advanced Combinatorial Mathematics 149
- Limits and Structures in Graph Theory 77
- Finite Group Theory Research 4
-
- Advanced Graph Theory Research 6
- Complexity and Algorithms in Graphs 4
- Co-authors
- Zoltán Füredi (25 shared papers)Vojtch Rödl (15 shared papers)Vojtěch Rödl (17 shared papers)R. Wilson (3 shared papers)Paul L. Erdos (3 shared papers)Norihide Tokushige (25 shared papers)Hiroshi Maehara (7 shared papers)Michel Marie Deza (14 shared papers)
- Journals
- Journal of Combinatorial Theory Series A (51 papers)European Journal of Combinatorics (39 papers)COMBINATORICA (28 papers)Discrete Mathematics (27 papers)Journal of Combinatorial Theory Series B (16 papers)
- Partner nations
- HungaryFranceUnited States
In The Last Decade
Péter Frankl
271 papers receiving 6.2k citations
Péter Frankl's Hit Papers
Peers
Comparison fields: 5 of 45
- Discrete Mathematics and Combinatorics 4.0k
- Computational Theory and Mathematics 759
- Artificial Intelligence 457
- Algebra and Number Theory 42
- Geometry and Topology 41
Countries citing papers authored by Péter Frankl
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
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.
All Works
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 → | 1981 | 380 |
| 2 | 1985 | 361 | |
| 3 | 1986 | 230 | |
| 4 | 1988 | 207 | |
| 5 | 1986 | 206 | |
| 6 | 1986 | 174 | |
| 7 | 1977 | 168 | |
| 8 | 1982 | 137 | |
| 9 | 1985 | 132 | |
| 10 | 1987 | 129 | |
| 11 | 2002 | 112 | |
| 12 | 1982 | 110 | |
| 13 | 1983 | 110 | |
| 14 | 1986 | 103 | |
| 15 | 1984 | 99 | |
| 16 | 1986 | 90 | |
| 17 | 1987 | 87 | |
| 18 | 1978 | 86 | |
| 19 | 2013 | 84 | |
| 20 | 1983 | 83 |
About Péter Frankl
Péter Frankl is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology and Applied Mathematics, having authored 297 papers that have together received 6.8k indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (149 papers), Limits and Structures in Graph Theory (77 papers), Coding theory and cryptography (7 papers), Advanced Graph Theory Research (6 papers), Complexity and Algorithms in Graphs (4 papers), Finite Group Theory Research (4 papers), Point processes and geometric inequalities (2 papers) and Mathematics and Applications (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (4.0k citations), Computational Theory and Mathematics (759 citations), Artificial Intelligence (457 citations), Algebra and Number Theory (42 citations) and Geometry and Topology (41 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.