DEEN
Magazin Humboldt Kosmos Newsroom Newsletter

Suche

Preise und Stipendien Recherche im Humboldt-Netzwerk

Suche nach Tags

Prof. Dr. Peter L. Erdös

Profil

Derzeitige StellungProfessor W-3 und Äquivalente
FachgebietKombinatorik
KeywordsNetwork Theory, bioinformatics, extremal combinatorics, stirng problems, graph algorithms

Aktuelle Kontaktadresse

LandUngarn
OrtBudapest
Universität/InstitutionEötvös Lorand Research Network
Institut/AbteilungA. Rényi Institute of Mathematics
Websitewww.renyi.hu/~elp

Gastgeber*innen während der Förderung

Prof. Dr. Dr. h.c. Bernhard KorteForschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn
Prof. Dr. Dr. h.c. Hans Jürgen PrömelForschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn
Prof. Dr. Andreas DressForschungsschwerpunkt Mathematisierung (FSPM) - Dynamik und Struktur komplexer Systeme, Universität Bielefeld, Bielefeld
Prof. Dr. Jens StoyeArbeitsgruppe Genominformatik, Universität Bielefeld, Bielefeld
Prof. Dr. Reinhard DiestelMathematisches Seminar, Universität Hamburg, Hamburg
Beginn der ersten Förderung01.12.1989

Programm(e)

1989Humboldt-Forschungsstipendien-Programm

Publikationen (Auswahl)

2022Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos: The mixing time of switch Markov chains: A unified approach. In: EUROPEAN JOURNAL OF COMBINATORICS, 99, 2022,
2021Bai, A. and Erdős, Péter and Semple, C. and Steel, M.: Defining phylogenetic networks using ancestral profiles. In: MATHEMATICAL BIOSCIENCES, 332, 2021,
2021Kharel, S. and Mezei, Tamás Róbert and Erdős, Péter and Chung, S. and Toroczkai, Z.: Degree-preserving network growth + SI. In: NATURE PHYSICS, 2021,
2021Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel: Half-graphs, other non-stable degree sequences, and the switch Markov chain. In: ELECTRONIC JOURNAL OF COMBINATORICS, 28, 2021,
2021Erdős, Péter and Francis, A. and Mezei, Tamás Róbert: Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. In: DISCRETE APPLIED MATHEMATICS, 294, 2021, 205-213
2019Erdős, Péter and Semple, C. and Steel, M.: A Class of Phylogenetic Networks Reconstructable from Ancestral Profiles. In: MATHEMATICAL BIOSCIENCES, 313, 2019, 33-40
2019Chor, B and Erdős, Péter and Komornik, J: A High Quartets Distance Construction. In: ANNALS OF COMBINATORICS, 23, 2019, 51-65
2019Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos: Mixing time of the Swap Markov chain and P-Stability. In: ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88, 2019, 659-665
2019Erdős, Péter and Ferrara, Michael and Stephen, G Hartke: Navigating Between Packings of Graphic Sequences. In: DISCRETE APPLIED MATHEMATICS, 266, 2019, 252-258
2019Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert: Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. In: THEORETICAL COMPUTER SCIENCE, 775, 2019, 16-25
2018Erdős, Péter and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel: Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. In: PLOS ONE, 13, 2018,
2018Janssen, R and Jones, M and Erdős, Péter and van Iersel, L and Scornavacca, C: Exploring the tiers of rooted phylogenetic network space using tail moves. In: BULLETIN OF MATHEMATICAL BIOLOGY, 80, 2018, 2177-2208
2018Erdős, Péter and Miklós, István and TOROCZKAI, Z: New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. In: COMBINATORICS PROBABILITY & COMPUTING, 27, 2018, 186-207
2018Erdős, Péter and van Iersel, Leo and Jones, Mark: Not all phylogenetic networks are leaf-reconstructible. In: JOURNAL OF MATHEMATICAL BIOLOGY, 79, 2018, 1623-1638
2018Erdős, Péter and Miklós, István: Not all simple looking degree sequence problems are easy. In: JOURNAL OF COMBINATORICS, 9, 2018, 553-566
2018Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert: Terminal-Pairability in Complete Bipartite Graphs. In: DISCRETE APPLIED MATHEMATICS, 236, 2018, 459-463
2017Erdős, Péter and Hartke, S G and van Iersel, L and Miklós, István: Graph realizations constrained by skeleton graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 24, 2017,
2017Erdős, Péter and Pálvölgyi, Dömötör and Tardif, C and Tardos, Gábor: REGULAR FAMILIES OF FORESTS, ANTICHAINS AND DUALITY PAIRS OF RELATIONAL STRUCTURES. In: COMBINATORICA, 37, 2017, 651-672
2015Erdős, Péter and Miklós, István and Toroczkai, Z: A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 29, 2015, 481-499
2015Erdős, Péter and Kiss, Sándor and Miklós, István and Soukup, Lajos: Approximate Counting of Graphical Realizations. In: PLOS ONE, 10, 2015,
2015Bassler, K.E. and Del Genio, C.I. and Erdős, Péter and Miklós, István and Toroczkai, Z.: Exact sampling of graphs with prescribed degree correlations. In: NEW JOURNAL OF PHYSICS, 17, 2015,
2015Czabarka, É and Dutle, A and Erdős, Péter and Miklós, István: On Realizations of a Joint Degree Matrix. In: DISCRETE APPLIED MATHEMATICS, 181, 2015, 283-288
2014Aydinian, H and Erdős, Péter: AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. In: ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 31, 2014, 1-14
2014Apostolico, A and Erdős, Péter and Miklós, István and Siemons, J: Modulated String Searching. In: THEORETICAL COMPUTER SCIENCE, 525, 2014, 23-29
2013Erdős, Péter and Tardif, C and Tardos, Gábor: Caterpillar dualities and regular languages. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 27, 2013, 1287-1294
2013Czabarka, É and Erdős, Péter and Johnson, V and Moulton, V: Generating functions for multi-labeled trees. In: DISCRETE APPLIED MATHEMATICS, 161, 2013, 107-117
2013Erdős, Péter and Tardif, C and Tardos, Gábor: On Infinite-finite Duality Pairs of Directed Graphs. In: ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 30, 2013, 807-819
2013Erdős, Péter and Király, Zoltán and Miklós, István: On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. In: COMBINATORICS PROBABILITY & COMPUTING, 22, 2013, 366-383
2013Miklós, István and Erdős, Péter and Soukup, Lajos: Towards random uniform sampling of bipartite graphs with given degree sequence. In: ELECTRONIC JOURNAL OF COMBINATORICS, 20, 2013, &
2012Cicalese, F and Erdős, Péter and Lipták, Z: A linear algorithm for string reconstruction in the reverse complement equivalence model. In: JOURNAL OF DISCRETE ALGORITHMS, 14, 2012, 37-54
2012Apostolico, A and Erdős, Péter and Győri, Ervin and Lipták, Zs and Cinzia, Pizzi: Efficient algorithms for the periodic subgraphs mining problem. In: JOURNAL OF DISCRETE ALGORITHMS, 17, 2012, 24-30
2012Apostolico, A and Erdős, Péter and Jüttner, Alpár: Parameterized searching with mismatches for run-length encoded strings. In: THEORETICAL COMPUTER SCIENCE, 454, 2012, 23-29
2012Erdős, Péter and Gerbner, Dániel and Lemons, Nathan and Mubayi, D and Palmer, Cory and Patkós, Balázs: Two-part set systems. In: ELECTRONIC JOURNAL OF COMBINATORICS, 19, 2012,
2011Aydinian, H and Czabarka, É and Erdős, Péter and Székely, L A: A tour of M-part L-Sperner families. In: JOURNAL OF COMBINATORIAL THEORY SERIES A, 118, 2011, 702-725
2011Czabarka, É and Erdős, Péter and Johnson, V and Kupczok, A and Székely, L A: Asymptotically normal distribution of some tree families relevant for phylogenetics, and of partitions without singletons. In: MOSCOW JOURNAL OF COMBINATORICS AND NUMBER THEORY, 1, 2011, 1-13
2011Erdős, Péter and Stoye, J and Soukup, Lajos: Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. In: APPLIED MATHEMATICS LETTERS, 24, 2011, 82-86
2011Cicalese, F and Erdős, Péter and Lipták, Z: Efficient reconstruction of RC-equivalent strings. In: LECTURE NOTES IN COMPUTER SCIENCE, 6460 LNCS, 2011, 349-362
2011Aydinian, H. and Erdős, Péter: On two-part Sperner systems for regular posets. In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 38, 2011, 87-92
2010Aydinian, H and Czabarka, É and Engel, K and Erdős, Péter and Székely, L A: A note on full transversals and mixed orthogonal arrays. In: AUSTRALASIAN JOURNAL OF COMBINATORICS, 48, 2010, 133-141
2010Erdős, Péter and Miklós, István and Toroczkai, Z: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 17, 2010,
2010Erdős, Péter and Soukup, Lajos: No Finite–Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. In: ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 27, 2010, 317-325
2010Apostolico, A and Erdős, Péter and Jüttner, Alpár: Parameterized searching with mismatches for run-length encoded strings (extended abstract). In: LECTURE NOTES IN COMPUTER SCIENCE, 6393 LNCS, 2010, 365-371
2009Kim, H and Toroczkai, Z and Erdős, Péter and Miklós, István and Székely, LA: Degree-based graph construction. In: JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 42, 2009,
2009Erdős, Péter and Soukup, Lajos: Quasi-kernels and quasi-sinks in infinite graphs. In: DISCRETE MATHEMATICS, 309, 2009, 3040-3048
2007Aydinian, H and Erdős, Péter: All maximum size two-part Sperner systems - in short. In: COMBINATORICS PROBABILITY & COMPUTING, 16, 2007, 553-555
2007Duffus, D and Erdős, Péter and Nešetril, J and Soukup, Lajos: Antichains in the homomorphism order of graphs. In: COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 48, 2007, 571-583
2007Erdős, Péter and Soukup, Lajos: How to split antichains in infinite posets. In: COMBINATORICA, 27, 2007, 147-161
2007Apostolico, A and Erdős, Péter and Lewenstein, M: Parameterized matching with mismatches. In: JOURNAL OF DISCRETE ALGORITHMS, 5, 2007, 135-140
2006Erdős, Péter and Ligeti, Péter and Sziklai, Péter and Torney, DC: Subwords in reverse-complement order. In: ANNALS OF COMBINATORICS, 10, 2006, 415-430
2005Erdős, Péter and Seress, Á and Székely, LA: Non-trivial $t$-intersection in the function lattice. In: ANNALS OF COMBINATORICS, 9, 2005, 177-187
2005Dress, AWM and Erdős, Péter: Reconstructing words from subwords in linear time. In: ANNALS OF COMBINATORICS, 8, 2005, 457-462
2005Erdős, Péter and Füredi, Zoltán and Katona, Gyula: Two-part and k-Sperner families: New proofs using permutations. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 19, 2005, 489-500
2004Erdős, Péter and Faigle, U and Hochstattler, W and Kern, W: Note on the game chromatic index of trees. In: THEORETICAL COMPUTER SCIENCE, 313, 2004, 371-376
2003D'yachkov, AG and Erdős, Péter and Macula, AJ and Rykov, VV and Torney, DC and Tung, C-S and Vilenkin, PA and White, PS: Exordium for DNA Codes. In: JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2003, 369-379
2003Dress, AWM and Erdős, Péter: X-trees and weighted quartet systems. In: ANNALS OF COMBINATORICS, 7, 2003, 155-169
2001Erdős, Péter and Sziklai, Péter and Torney, DC: A finite word poset. In honor of Aviezri Fraenkel on the occasion of his 70th birthday. In: ELECTRONIC JOURNAL OF COMBINATORICS, 8, 2001,
2000Erdős, Péter and Seress, Á and Székely, LA: Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets. In: COMBINATORICA, 20, 2000, 27-45
2000Erdős, Péter and Székely, LA: Erdős-Ko-Rado theorems of higher order - a survey. Numbers, Information and Complexity. 2000. 117-124
1999Erdős, Péter and Steel, MA and Székely, LA and Warnow, TJ: A few logs suffice to build (almost) all trees, I. In: RANDOM STRUCTURES & ALGORITHMS, 14, 1999, 153-184
1999Erdős, Péter and Steel, MA and Székely, LA and Warnow, TJ: A few logs suffice to build (almost) all trees, II. In: THEORETICAL COMPUTER SCIENCE, 221, 1999, 77-118
1999Erdős, Péter: Some generalizations of property B and the splitting property. In: ANNALS OF COMBINATORICS, 3, 1999, 53-59
1998Erdős, Péter and Frank, András and Székely, L A: Minimum multiway cuts in trees. In: DISCRETE APPLIED MATHEMATICS, 87, 1998, 67-75
1997Erdős, Péter: A Mathematica programcsomag Discrete Mathematics rutingyüjteménye. In: MATEMATIKAI LAPOK, 1994, 1997, 82-99
1997Erdős, Péter and Steel, MA and Székely, LA and Warnow, TJ: Constructing big trees from short sequences. Automata, Languages and Programming. 1997. 827-837
1997Ahlswede, R and Alon, N and Erdős, Péter and Ruszinkó, Miklós and Székely, LA: Intersecting systems. In: COMBINATORICS PROBABILITY & COMPUTING, 6, 1997, 127-137
1997Erdős, Péter and Steel, MA and Székely, LA and Warnow, TJ: Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. In: COMPUTERS AND ARTIFICAL INTELLIGENCE, 16, 1997, 217-227
1997Erdős, Péter and Székely, LA: Pseudo-LYM inequalities and AZ identities. In: ADVANCES IN APPLIED MATHEMATICS, 19, 1997, 431-443
1997Erdős, Péter: Splitting property in infinite posets. In: DISCRETE MATHEMATICS, 163, 1997, 251-256
1997Erdős, Péter and Rice, K and Steel, M A and Székely, L A and Warnow, T J: The Short Quartet Method. Math. Modeling and Sci.. 1997. &-&
1995Ahlswede, R and Erdős, Péter and Graham, N: A splitting property of maximal antichains. In: COMBINATORICA, 15, 1995, 475-480
1994Erdős, Péter: A Mathematica programcsomag Discrete Mathematics rutingyűjteménye. In: MATEMATIKAI LAPOK, 4, 1994, 82-99
1994Erdős, Péter and Székely, LA and Seress, Á: On intersecting chains in Boolean algebras. In: COMBINATORICS PROBABILITY & COMPUTING, 3, 1994, 57-62
1994Erdős, Péter: On the reconstruction of combinatorial structures from line-graphs. In: STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 29, 1994, 341-347
1994Erdős, Péter and Székely, LA: On weighted multiway cuts in trees. In: MATHEMATICAL PROGRAMMING, 65, 1994, 93-105
1994Székely, LA and Erdős, Péter and Steel, MA: The combinatorics of reconstructing evolutionary trees. In: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING, 15, 1994, 241-254
1993Székely, LA and Erdős, Péter and Steel, MA and Penny, D: A Fourier inversion formula for evolutionary trees. In: APPLIED MATHEMATICS LETTERS, 6, 1993, 13-17
1993Steel, MA and Székely, LA and Erdős, Péter and Waddell, P: A complete family of phylogenetic invariants for any number of taxa. In: NEW ZEALAND JOURNAL OF BOTANY, 31, 1993, 289-296
1993Erdős, Péter: A new bijection on rooted forests. In: DISCRETE MATHEMATICS, 111, 1993, 179-188
1993Erdős, Péter and Székely, LA: Counting bichromatic evolutionary trees. In: DISCRETE APPLIED MATHEMATICS, 47, 1993, 1-8
1993Székely, LA and Steel, MA and Erdős, Péter: Fourier calculus on evolutionary trees. In: ADVANCES IN APPLIED MATHEMATICS, 14, 1993, 200-216
1992Erdős, Péter and Faigle, U and Kern, W: A group-theoretic setting for some intersecting Sperner families. In: COMBINATORICS PROBABILITY & COMPUTING, 1, 1992, 323-334
1992Erdős, Péter and Székely, LA: Evolutionary trees: An integer multicommodity max-flow-min-cut theorem. In: ADVANCES IN APPLIED MATHEMATICS, 13, 1992, 375-389
1992Erdős, Péter and Frankl, Péter and Kleitman, DJ and Saks, M and Székely, LA: Sharpening the LYM inequality. In: COMBINATORICA, 12, 1992, 295-301
1992Steel, M and Hendy, M and Székely, L A and Erdős, Péter: Spectral analysis and a closest tree method for genetic sequences. In: APPLIED MATHEMATICS LETTERS, 5, 1992, 63-67
1990Engel, K and Erdős, Péter: POLYTOPES DETERMINED BY COMPLEMENT-FREE SPERNER FAMILIES. In: DISCRETE MATHEMATICS, 81, 1990, 165-169
1989Erdős, Péter and Székely, L A: Applications of antilexicographic order I.. In: ADVANCES IN APPLIED MATHEMATICS, 10, 1989, 488-496
1989Erdős, Péter and Engel, K: Sperner families satisfying additional conditions and their convex hulls. In: GRAPHS AND COMBINATORICS, 5, 1989, 47-56
1987Erdős, Péter and Katona, Gyula: A 3-part Sperner theorem. In: STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 22, 1987, 383-393
1986Erdős, Péter and Katona, Gyula: All Maximum 2-part Sperner Families. In: JOURNAL OF COMBINATORIAL THEORY SERIES A, 43, 1986, 58-69
1986Erdős, Péter and Katona, Gyula: Convex hulls of more-part Sperner families. In: GRAPHS AND COMBINATORICS, 2, 1986, 123-134
1985Erdős, Péter and Győri, Ervin: Any four independent edges of a 4-connected graph are contained in a circuit. In: ACTA MATHEMATICA HUNGARICA, 46, 1985, 311-313
1985Erdős, Péter and Frankl, Péter and Katona, Gyula: Extremal hypergraphs problems and convex hulls. In: COMBINATORICA, 5, 1985, 11-26
1984Erdős, Péter and Frankl, Péter and Katona, Gyula: Intersecting Sperner families and their convex hulls,. In: COMBINATORICA, 4, 1984, 21-34
1980Erdős, Péter and Füredi, Zoltán: On automorphisms of line-graphs. In: EUROPEAN JOURNAL OF COMBINATORICS, 1, 1980, 341-345
1976Erdős, Péter: A Ramsey-type theorem (Ramsey típusú tétel). In: MATEMATIKAI LAPOK, 27, 1976, 361-364