World's Best Scientists 2026 revealed!
Award Badge
Mathematics
Russia
2022

D-Index & Metrics

Mathematics

D-Index
62
Citations
12530
World Ranking
485
National Ranking
5

Engineering and Technology

D-Index
62
Citations
12152
World Ranking
1944
National Ranking
5

Research.com Recognitions

  • 2022 - Research.com Mathematics in Russia Leader Award

Overview

Peter Frankl is affiliated with the Alfréd Rényi Institute of Mathematics in Hungary. Their research primarily spans the fields of Mathematics and Computer Science, with significant contributions in subfields such as Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering, and Algebra and Number Theory.

Their work focuses heavily on topics related to graph theory and combinatorics. Key areas include Limits and Structures in Graph Theory, Advanced Graph Theory Research, graph theory and CDMA systems, Graph theory and applications, Graph Labeling and Dimension Problems, Advanced Topology and Set Theory, and Analytic Number Theory Research.

Peter Frankl has published extensively in several frequent venues. Notable among these are:

  • arXiv (Cornell University)
  • European Journal of Combinatorics
  • Discrete Mathematics
  • Journal of Combinatorial Theory Series A
  • Acta Mathematica Academiae Scientiarum Hungaricae

Recent papers include:

  • The Erdős Matching Conjecture and concentration inequalities (2022) in Journal of Combinatorial Theory Series B
  • Maximum degree and diversity in intersecting hypergraphs (2020) in Journal of Combinatorial Theory Series B
  • Improved bounds on the maximum diversity of intersecting families (2023) in European Journal of Combinatorics

Frequent collaborators include:

  • Andrey Kupavskii
  • Jian Wang
  • János Pach

Peter Frankl's publication record shows an engagement with combinatorial structures and graph theory applications, reflected in a variety of journal articles published mostly in combinatorics-focused periodicals.

Best Publications

  • Intersection theorems with geometric consequences

    Peter Frankl;Richard M. Wilson

  • Families of finite sets in which no set is covered by the union ofr others

    P. Erdös;P. Frankl;Z. Füredi

  • Complexity classes in communication complexity theory

    Laszlo Babai;Peter Frankl;Janos Simon

  • The Johnson-Lindenstrauss lemma and the sphericity of some graphs

    Peter Frankl;Hiroshi Maehara

  • 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

  • Some intersection theorems for ordered sets and graphs

    F R Chung;R L Graham;P Frankl;J B Shearer

  • On the maximum number of permutations with given maximal or minimal distance

    Peter Frankl;Mikhail Deza

  • An Extremal Problem for two Families of Sets

    Peter Frankl

  • The Erdo¨s-Ko-Rado theorem for vector spaces

    P Frankl;R M Wilson

  • Erdös–Ko–Rado Theorem—22 Years Later

    M. Deza;P. Frankl

  • Near Perfect Coverings in Graphs and Hypergraphs

    Peter Frankl;Vojtech Rödl

  • Extremal problems on set systems

    Peter Frankl;Vojtech Rödl

  • Cops and robbers in graphs with large girth and Cayley graphs

    P. Frankl

  • Families of finite sets in which no set is covered by the union of two others

    Paul Erdös;Peter Frankl;Zoltán Füredi

  • Improved bounds for Erdős' Matching Conjecture

    Peter Frankl

  • Hypergraphs do not jump

    Peter Frankl;Vojtěch Rödl

  • On intersecting families of finite sets

    Peter Frankl

  • The chromatic number of kneser hypergraphs

    Noga Mordechai Alon;P. Frankl;L. Lovasz

  • Large triangle-free subgraphs in graphs without K 4

    Peter Frankl;Vojtech Rödl;Vojtech Rödl

  • Forbidding just one intersection

    Peter Frankl;Zoltán Füredi

  • A new generalization of the Erdős-Ko-Rado theorem

    Peter Frankl;Zoltán Füredi

  • Extremal problems on set systems: Extremal Problems on Set Systems

    Peter Frankl;Vojtěch Rödl

Frequent Co-Authors

Zoltán Füredi
Zoltán Füredi University of Illinois at Urbana-Champaign
Vojtěch Rödl
Vojtěch Rödl Emory University
János Pach
János Pach Alfréd Rényi Institute of Mathematics
László Babai
László Babai University of Chicago
Ron Graham
Ron Graham University of California, San Diego
Noga Alon
Noga Alon Tel Aviv University
Michel Deza
Michel Deza École Normale Supérieure
Andrzej Ruciński
Andrzej Ruciński Adam Mickiewicz University in Poznań
Paul Erdös
Paul Erdös Hungarian Academy of Sciences
Peter J. Cameron
Peter J. Cameron University of St Andrews

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, expanding into related fields can open diverse career opportunities. A popular option is pursuing a data analytics master's degree, which combines mathematical theories with real-world data skills. This pathway is highly relevant given the growing demand for data-driven decision-making across industries.

Business professionals looking to blend quantitative skills with leadership might explore MBA programs. Those seeking less competitive admissions can consider some of the easiest MBA programs to get into, providing flexible routes into management roles. Similarly, the easiest MBA program options offer streamlined online study tailored for working adults balancing education and career.

For those aiming at higher executive roles or specialized business administration career paths, most affordable online DBA programs present an economical way to earn a Doctorate in Business Administration. This advanced degree can complement a math background with strategic leadership and research expertise.

By integrating math skills with these related degrees, graduates can enhance their marketability and prepare for dynamic career pathways.

Best Scientists Citing Peter Frankl

Trending Scientists

Recently Published Articles