Péter Frankl

9.6k total citations
267 papers, 5.3k citations indexed

About

Péter Frankl is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Péter Frankl has authored 267 papers receiving a total of 5.3k indexed citations (citations by other indexed papers that have themselves been cited), including 219 papers in Discrete Mathematics and Combinatorics, 144 papers in Computational Theory and Mathematics and 111 papers in Geometry and Topology. Recurrent topics in Péter Frankl's work include Limits and Structures in Graph Theory (211 papers), Advanced Graph Theory Research (115 papers) and graph theory and CDMA systems (90 papers). Péter Frankl is often cited by papers focused on Limits and Structures in Graph Theory (211 papers), Advanced Graph Theory Research (115 papers) and graph theory and CDMA systems (90 papers). Péter Frankl collaborates with scholars based in Hungary, France and United States. Péter Frankl's 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 and has published in prestigious journals such as Journal of Power Sources, Annals of the New York Academy of Sciences and Annals of Mathematics.

In The Last Decade

Péter Frankl

246 papers receiving 4.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Péter Frankl Hungary	40	3.8k	3.4k	2.0k	1.4k	869	267	5.3k
Zoltán Füredi Hungary	34	2.3k 0.6×	2.3k 0.7×	1.4k 0.7×	897 0.6×	505 0.6×	200	4.0k
Endre Szemerédi United States	42	3.6k 0.9×	4.2k 1.2×	1.9k 0.9×	1.0k 0.7×	1.5k 1.7×	148	6.8k
László Babai United States	40	1.9k 0.5×	4.2k 1.2×	879 0.4×	1.4k 1.0×	4.0k 4.6×	165	6.8k
János Komlós United States	35	1.7k 0.4×	2.4k 0.7×	880 0.4×	667 0.5×	1.3k 1.5×	76	4.6k
Andries E. Brouwer Netherlands	16	1.8k 0.5×	1.1k 0.3×	1.4k 0.7×	1.1k 0.8×	1.0k 1.2×	54	3.1k
Benny Sudakov United States	30	2.4k 0.6×	2.6k 0.8×	1.4k 0.7×	439 0.3×	351 0.4×	276	3.5k
Carsten Thomassen Denmark	40	2.1k 0.6×	4.6k 1.4×	1.3k 0.7×	1.2k 0.8×	146 0.2×	219	5.4k
Andrzej Ruciński Poland	26	2.5k 0.6×	2.2k 0.6×	1.5k 0.8×	495 0.4×	324 0.4×	143	3.9k
Vojtěch Rödl United States	34	3.3k 0.9×	3.0k 0.9×	2.2k 1.1×	720 0.5×	201 0.2×	224	3.9k
Arjeh M. Cohen Netherlands	20	1.8k 0.5×	576 0.2×	1.1k 0.6×	986 0.7×	1.0k 1.2×	90	3.0k

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-authorship network of co-authors of Péter Frankl

This figure shows the co-authorship network connecting the top 25 collaborators of Péter Frankl. A scholar is included among the top collaborators of Péter Frankl based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Péter Frankl. Péter Frankl is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Frankl, Péter & Jian Wang. (2025). On the C -diversity of intersecting k -graphs. European Journal of Combinatorics. 130. 104199–104199.

Frankl, Péter & Jian Wang. (2025). Intersecting families with covering number five. Discrete Mathematics. 348(9). 114546–114546. 1 indexed citations

Bárány, Imre, et al.. (2023). Piercing the chessboard. SZTE Publicatio Repozitórium (University of Szeged).

Frankl, Péter, Simon A. Hunt, Søren Højgaard Jensen, et al.. (2023). Performance characterization of metal-supported solid-oxide fuel cell stacks at elevated pressure. Journal of Power Sources. 573. 233083–233083. 11 indexed citations

Frankl, Péter, et al.. (2023). Uniform intersecting families with large covering number. European Journal of Combinatorics. 113. 103747–103747. 1 indexed citations

Frankl, Péter, et al.. (2023). Some inequalities concerning cross-intersecting families of integer sequences. Discrete Mathematics. 346(12). 113574–113574. 1 indexed citations

Alon, Noga & Péter Frankl. (2023). Turán graphs with bounded matching number. Journal of Combinatorial Theory Series B. 165. 223–229. 4 indexed citations

Frankl, Péter & Andrey Kupavskii. (2023). Intersection theorems for (−1,0,1)-vectors. European Journal of Combinatorics. 117. 103830–103830. 2 indexed citations

Frankl, Péter & Andrey Kupavskii. (2019). Some results around the Erdős Matching Conjecture. 88(3). 695–699.

10.

Frankl, Péter & Andrey Kupavskii. (2017). Uniform s-Cross-Intersecting Families. Combinatorics Probability Computing. 26(4). 517–524. 6 indexed citations

11.

Frankl, Péter, Yoshiharu Kohayakawa, & Vojtěch Rödl. (2015). A note on supersaturated set systems. European Journal of Combinatorics. 51. 190–199. 4 indexed citations

12.

Frankl, Péter & Vojtěch Rödl. (2002). Extremal problems on set systems. Random Structures and Algorithms. 20(2). 131–164. 69 indexed citations

13.

Frankl, Péter. (1996). Extremal set systems. MIT Press eBooks. 1293–1329. 40 indexed citations

14.

Frankl, Péter. (1996). An Erdos–Ko–Rado Theorem for Direct Products. European Journal of Combinatorics. 17(8). 727–730. 18 indexed citations

15.

Frankl, Péter & V. Rödl. (1990). A partition property of simplices in Euclidean space. Journal of the American Mathematical Society. 3(1). 1–7. 42 indexed citations

16.

Frankl, Péter & Vojtěch Rödl. (1987). Forbidden intersections. Transactions of the American Mathematical Society. 300(1). 259–286. 87 indexed citations

17.

Frankl, Péter, V. Rödl, & R. Wilson. (1987). The number of sub-matrics of a given type in a Hadamard matrix and related results. Journal of Combinatorial Theory Series A. 44(3). 317–328. 9 indexed citations

18.

Deza, Michel & Péter Frankl. (1987). A helly type theorem for hypersurfaces. Journal of Combinatorial Theory Series A. 45(1). 27–30. 6 indexed citations

19.

Alon, Noga, Péter Frankl, & László Lovász. (1986). The chromatic number of Kneser hypergraphs. Transactions of the American Mathematical Society. 298(1). 359–370. 59 indexed citations

20.

Frankl, Péter & Vojtěch Rödl. (1986). All Triangles are Ramsey. Transactions of the American Mathematical Society. 297(2). 777–777. 7 indexed citations

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