Péter L. Erdős

11.6k total citations · 1 hit paper
185 papers, 5.0k citations indexed

About

Péter L. Erdős is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Péter L. Erdős has authored 185 papers receiving a total of 5.0k indexed citations (citations by other indexed papers that have themselves been cited), including 87 papers in Computational Theory and Mathematics, 65 papers in Geometry and Topology and 62 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Péter L. Erdős's work include Limits and Structures in Graph Theory (57 papers), Advanced Graph Theory Research (48 papers) and Graph theory and applications (27 papers). Péter L. Erdős is often cited by papers focused on Limits and Structures in Graph Theory (57 papers), Advanced Graph Theory Research (48 papers) and Graph theory and applications (27 papers). Péter L. Erdős collaborates with scholars based in Hungary, United States and Germany. Péter L. Erdős's co-authors include R. Rado, A. Hajnal, Chao Ko, Péter Frankl, N.G. de Bruijn, A. Rényi, J. L. Selfridge, Łászló A. Székely, Mike Steel and D. A. Darling and has published in prestigious journals such as PLoS ONE, Nature Physics and Mathematics of Computation.

In The Last Decade

Péter L. Erdős

177 papers receiving 4.5k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

1961 819 citations Péter L. Erdős et al. profile →

Peers

Countries citing papers authored by Péter L. Erdős

Since Specialization

Citations

This map shows the geographic impact of Péter L. Erdős'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 L. Erdős 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 L. Erdős more than expected).

Fields of papers citing papers by Péter L. Erdős

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Péter L. Erdős. 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 L. Erdős. The network helps show where Péter L. Erdős may publish in the future.

Co-authorship network of co-authors of Péter L. Erdős

This figure shows the co-authorship network connecting the top 25 collaborators of Péter L. Erdős. A scholar is included among the top collaborators of Péter L. Erdős 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 L. Erdős. Péter L. Erdős 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

#	Work	Indexed citations
1	Defining phylogenetic networks using ancestral profiles 2021 ·Mathematical Biosciences ·(unknown), Péter L. Erdős, Charles Semple, Mike Steel	8
2	Terminal-pairability in complete bipartite graphs 2017 ·Discrete Applied Mathematics ·(unknown), Péter L. Erdős, Ervin Győri, (unknown)	0
3	A note on full transversals and mixed orthogonal arrays 2010 ·Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) ·(unknown), Éva Czabarka, Konrad Engel, Péter L. Erdős, Łászló A. Székely	1
4	Balanced vertices in trees and a simpler algorithm to compute the genomic distance 2010 ·Applied Mathematics Letters ·Péter L. Erdős, Lajos Soukup, Jens Stoye	2
5	Graphs of diameter two with no 4-circuits 1999 ·Discrete Mathematics ·J. A. Bondy, Péter L. Erdős, Siemion Fajtlowicz	14
6	Minimum multiway cuts in trees 1998 ·Discrete Applied Mathematics ·Péter L. Erdős, András Frank, Łászló A. Székely	2
7	Pseudo-LYM Inequalities and AZ Identities 1997 ·Advances in Applied Mathematics ·Péter L. Erdős, Łászló A. Székely	5
8	Local quartet splits of a binary tree inferall quartet splits via one dyadic inference rule 1996 ·Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) ·Péter L. Erdős, Mike Steel, Łászló A. Székely, Tandy Warnow	12
9	On practical partitions 1995 ·Collectanea mathematica ·Péter L. Erdős, Jean-Louis Nicolas	2
10	A local density condition for triangles 1994 ·Discrete Mathematics ·Péter L. Erdős, Ralph J. Faudree, Cecil Rousseau, R. H. Schelp	19
11	A complete family of phylogenetic invariants for any number of taxa under Kimura's 3ST model 1993 ·New Zealand Journal of Botany ·Mike Steel, Łászló A. Székely, Péter L. Erdős, Peter J. Waddell	47
12	Fourier Calculus on Evolutionary Trees 1993 ·Advances in Applied Mathematics ·Łászló A. Székely, Mike Steel, Péter L. Erdős	42
13	Algorithms and Min-max Theorems for Certain Multiway Cuts. 1992 ·University of Twente Research Information ·Péter L. Erdős, (unknown)	2
14	On convergent interpolatory polynomials 1989 ·Journal of Approximation Theory ·Péter L. Erdős, András Kroó, J. Szabados	3
15	The Ramsey number for the pair complete bipartite graph-graph of limited degree 1985 ·John Wiley & Sons, Inc. eBooks ·Stefan Burr, Péter L. Erdős, Ralph J. Faudree, Cecil Rousseau	7
16	Problems and results on chromatic numbers in finite and infinite graphs 1985 ·John Wiley & Sons, Inc. eBooks ·Péter L. Erdős	3
17	Graphs with certain families of spanning trees 1982 ·Journal of Combinatorial Theory Series B ·Péter L. Erdős, Ralph J. Faudree, Cecil Rousseau, R. H. Schelp	4
18	Ramsey theorems for multiple copies of graphs 1975 ·Transactions of the American Mathematical Society ·Stefan Burr, Péter L. Erdős, J. Spencer	51
19	On a combinatorial game 1973 ·Journal of Combinatorial Theory Series A ·Péter L. Erdős, J. L. Selfridge	152
20	On the solvability of the equations [ai, aj] = ar and (a′i, a′j) = a′r in sequences of positive density 1966 ·Journal of Mathematical Analysis and Applications ·Péter L. Erdős, Andràs Sárközy, Endre Szemerédi	2

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