Péter Frankl
- Discrete Mathematics and Combinatorics top 0.01%
- Limits and Structures in Graph Theory 211
- Finite Group Theory Research 38
- Geometry and Topology top 0.1%
- Graph theory and applications 54
- Advanced Topology and Set Theory 44
- Computational Theory and Mathematics top 0.05%
- Advanced Graph Theory Research 115
- Graph Labeling and Dimension Problems 35
- Algebra and Number Theory top 5%
- Analytic Number Theory Research 23
-
- graph theory and CDMA systems 90
- Co-authors
- Zoltán FürediVojtěch RödlR. WilsonV. RödlNorihide TokushigeMichel DezaPéter L. ErdősLászló Babai
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- Journal of Combinatorial Theory Series A (50 papers)European Journal of Combinatorics (33 papers)COMBINATORICA (26 papers)
- Partner nations
- HungaryFranceUnited States
In The Last Decade
Péter Frankl
246 papers receiving 4.7k citations
Peers
Comparison fields: 5 of 75
- Discrete Mathematics and Combinatorics 3.8k
- Geometry and Topology 2.0k
- Computational Theory and Mathematics 3.4k
- Algebra and Number Theory 267
- Computer Graphics and Computer-Aided Design 120
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2025 | 1 | |
| 3 | 2023 | 0 | |
| 4 | 2023 | 11 | |
| 5 | 2023 | 1 | |
| 6 | 2023 | 1 | |
| 7 | 2023 | 4 | |
| 8 | 2023 | 2 | |
| 9 | Some results around the Erdős Matching Conjecture | 2019 | 0 |
| 10 | 2017 | 6 | |
| 11 | 2015 | 4 | |
| 12 | 2002 | 69 | |
| 13 | Extremal set systems | 1996 | 40 |
| 14 | 1996 | 18 | |
| 15 | 1990 | 42 | |
| 16 | 1987 | 87 | |
| 17 | The number of sub-matrics of a given type in a Hadamard matrix and related results | 1987 | 9 |
| 18 | 1987 | 6 | |
| 19 | 1986 | 59 | |
| 20 | 1986 | 7 |
About Péter Frankl
Péter Frankl is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Numerical Analysis, having authored 267 papers that have together received 5.3k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (211 papers), Advanced Graph Theory Research (115 papers), graph theory and CDMA systems (90 papers), Graph theory and applications (54 papers), Advanced Topology and Set Theory (44 papers), Finite Group Theory Research (38 papers), Graph Labeling and Dimension Problems (35 papers) and Analytic Number Theory Research (23 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (3.8k citations), Geometry and Topology (2.0k citations), Computational Theory and Mathematics (3.4k citations), Algebra and Number Theory (267 citations) and Computer Graphics and Computer-Aided Design (120 citations). Péter Frankl has collaborated with scholars based in Hungary, France and United States. Frequent co-authors include Zoltán Füredi, Vojtěch Rödl, R. Wilson, V. Rödl, Norihide Tokushige, Michel Deza, Péter L. Erdős, László Babai, P. Erdös and Janoš Šimon. 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.