Péter L. Erdős
Péter L. Erdős
Scientific Adviser, A. Renyi Institue of Mathematics, HAS
Verified email at renyi.mta.hu - Homepage
Cited by
Cited by
A few logs suffice to build (almost) all trees (I)
PL Erdos, MA Steel, LA Székely, TJ Warnow
Random Structures and Algorithms 14 (2), 153-184, 1999
Fourier calculus on evolutionary trees
MA Steel
Adv Appl Math 14, 200-216, 1993
Degree-based graph construction
H Kim, Z Toroczkai, PL Erdős, I Miklós, LA Székely
Journal of Physics A: Mathematical and Theoretical 42, 392001, 2009
A complete family of phylogenetic invariants for any number of taxa under Kimura's 3ST model
M Steel, L Székely, PL Erdös, P Waddell
New Zealand journal of botany 31 (3), 289-296, 1993
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
PL Erdős, I Miklós, Z Toroczkai
arXiv preprint arXiv:0905.4913, 2009
Exordium for DNA codes
AG D'yachkov, PL Erdös, AJ Macula, VV Rykov, DC Torney, CS Tung, ...
Journal of Combinatorial Optimization 7 (4), 369-379, 2003
Constructing big trees from short sequences
PL Erdös, MA Steel, LA Székely, TJ Warnow
International Colloquium on Automata, Languages, and Programming, 827-837, 1997
Towards random uniform sampling of bipartite graphs with given degree sequence
PL Erdös, I Miklós, L Soukup
Electronic Journal of Combinatorics 20 (1), #16, 2013
On weighted multiway cuts in trees
PL Erdős, LA Székely
Mathematical programming 65 (1), 93-105, 1994
Extremal hypergraph problems and convex hulls
PL Erdős, GOH Katona, P Frankl
Combinatorica 5 (1), 11-26, 1985
Parameterized matching with mismatches
A Apostolico, PL Erdős, M Lewenstein
Journal of Discrete Algorithms 5 (1), 135-140, 2007
Intersecting Sperner families and their convex hulls
PL Erdős, P Frankl, GOH Katona
Combinatorica 4 (1), 21-34, 1984
Spectral analysis and a closest tree method for genetic sequences
MA Steel, MD Hendy, LA Székely, PL Erdös
Applied mathematics letters 5 (6), 63-67, 1992
Note on the game chromatic index of trees
PL Erdös, U Faigle, W Hochstättler, W Kern
Theoretical Computer Science 313 (3), 371-376, 2004
Exact sampling of graphs with prescribed degree correlations
KE Bassler, CI Del Genio, PL Erdős, I Miklós, Z Toroczkai
New Journal of Physics 17 (8), 083052, 2015
A group-theoretic setting for some intersecting Sperner families
PL Erdős, U Faigle, W Kern
Combinatorics, Probability and Computing 1 (4), 323-334, 1992
Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule
PL Erdos, MA Steel, LA Szekely, T Warnow
Computers and Artificial Intelligence 16 (2), 217-227, 1997
A splitting property of maximal antichains
R Ahlswede, PL Erdős, N Graham
Combinatorica 15 (4), 475-480, 1995
Applications of antilexicographic order. I. An enumerative theory of trees
PL Erdos, LA Székely
Advances in Applied Mathematics 10 (4), 488-496, 1989
Evolutionary trees: an integer multicommodity max-flow-min-cut theorem
PL Erdös, L Székely
Advances in Applied Mathematics 13 (4), 375-389, 1992
The system can't perform the operation now. Try again later.
Articles 1–20