On Automorphisms of Line-graphs. - Péter L. Erdös; Zoltán Füredi (Eur. J. Comb., 1980)

Intersecting Sperner families and their convex hulls. - Péter L. Erdös; Peter Frankl; Gyula O. H. Katona (Comb., 1984)

Extremal hypergraph problems and convex hulls. - Péter L. Erdös; Peter Frankl; Gyula O. H. Katona (Comb., 1985)

Convex hulls of more-part Sperner families. - Péter L. Erdös; Gyula O. H. Katona (Graphs Comb., 1986)

All maximum 2-part Sperner families. - Péter L. Erdös; Gyula O. H. Katona (J. Comb. Theory A, 1986)

Sperner families satisfying additional conditions and their convex hulls. - Konrad Engel; Péter L. Erdös (Graphs Comb., 1989)

Polytopes determined by complementfree Sperner families. - Konrad Engel; Péter L. Erdös (Discret. Math., 1990)

Algorithms and Min-max Theorems for Certain Multiway Cuts. - Péter L. Erdös; László A. Székely (IPCO, 1992)

Sharpening the LYM inequality. - Péter L. Erdös; Peter Frankl; Daniel J. Kleitman; Michael E. Saks; László A. Székely (Comb., 1992)

A Group-Theoretic Setting for Some Intersecting Sperner Families. - Péter L. Erdös; Ulrich Faigle; Walter Kern (Comb. Probab. Comput., 1992)

Counting Bichromatic Evolutionary Trees. - Péter L. Erdös; László A. Székely (Discret. Appl. Math., 1993)

A new bijection on rooted forests. - Péter L. Erdös (Discret. Math., 1993)

On Intersecting Chains in Boolean Algebras. - Péter L. Erdös; Ákos Seress; László A. Székely (Comb. Probab. Comput., 1994)

On weighted multiway cuts in trees. - Péter L. Erdös; László A. Székely (Math. Program., 1994)

A Splitting Property of Maximal Antichains. - Rudolf Ahlswede; Péter L. Erdös; Niall Graham (Comb., 1995)

On the average rank of LYM-sets. - Péter L. Erdös; Ulrich Faigle; Walter Kern (Discret. Math., 1995)

Constructing Big Trees from Short Sequences. - Péter L. Erdös; Mike A. Steel; László A. Székely; Tandy J. Warnow (ICALP, 1997)

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. - Péter L. Erdös; Mike A. Steel; László A. Székely; Tandy J. Warnow (Comput. Artif. Intell., 1997)

Intersecting Systems. - Rudolf Ahlswede; Noga Alon; Péter L. Erdös; Miklós Ruszinkó; László A. Székely (Comb. Probab. Comput., 1997)

Splitting property in infinite posets. - Péter L. Erdös (Discret. Math., 1997)

Minimum Multiway Cuts in Trees. - Péter L. Erdös; András Frank; László A. Székely (Discret. Appl. Math., 1998)

A few logs suffice to build (almost) all trees (I). - Péter L. Erdös; Michael Anthony Steel; László A. Székely; Tandy J. Warnow (Random Struct. Algorithms, 1999)

A Few Logs Suffice to Build (almost) All Trees: Part II. - Péter L. Erdös; Michael Anthony Steel; László A. Székely; Tandy J. Warnow (Theor. Comput. Sci., 1999)

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. - Péter L. Erdös; Ákos Seress; László A. Székely (Comb., 2000)

A Finite Word Poset. - Péter L. Erdös; Péter Sziklai; David C. Torney (Electron. J. Comb., 2001)

Exordium for DNA Codes. - Arkadii G. D'yachkov; Péter L. Erdös; Anthony J. Macula; Vyacheslav V. Rykov; David C. Torney; Chang-Shung Tung; Pavel A. Vilenkin; P. Scott White (J. Comb. Optim., 2003)

Note on the game chromatic index of trees. - Péter L. Erdös; Ulrich Faigle; Winfried Hochstättler; Walter Kern (Theor. Comput. Sci., 2004)

Two-Part and k-Sperner Families: New Proofs Using Permutations. - Péter L. Erdös; Zoltán Füredi; Gyula O. H. Katona (SIAM J. Discret. Math., 2005)

Subwords in reverse-complement order. - Péter L. Erdös; Péter Ligeti; Péter Sziklai; David C. Torney (Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 2006)

How To Split Antichains In Infinite Posets. - Péter L. Erdös; Lajos Soukup (Comb., 2007)

All Maximum Size Two-Part Sperner Systems: In Short. - Harout K. Aydinian; Péter L. Erdös (Comb. Probab. Comput., 2007)

Parameterized matching with mismatches. - Alberto Apostolico; Péter L. Erdös; Moshe Lewenstein (J. Discrete Algorithms, 2007)

Quasi-kernels and quasi-sinks in infinite graphs. - Péter L. Erdös; Lajos Soukup (Discret. Math., 2009)

Efficient Reconstruction of RC-Equivalent Strings. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (IWOCA, 2010)

Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). - Alberto Apostolico; Péter L. Erdös; Alpár Jüttner (SPIRE, 2010)

A note on full transversals and mixed orthogonal arrays. - Harout K. Aydinian; Éva Czabarka; Konrad Engel; Péter L. Erdös; László A. Székely (Australas. J Comb., 2010)

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. - Péter L. Erdös; István Miklós; Zoltán Toroczkai (Electron. J. Comb., 2010)

No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. - Péter L. Erdös; Lajos Soukup (Order, 2010)

Balanced vertices in trees and a simpler algorithm to compute the genomic distance. - Péter L. Erdös; Lajos Soukup; Jens Stoye (Appl. Math. Lett., 2011)

On two-part Sperner systems for regular posets (Extended Abstract). - Harout K. Aydinian; Péter L. Erdös (Electron. Notes Discret. Math., 2011)

A tour of M-part L-Sperner families. - Harout K. Aydinian; Éva Czabarka; Péter L. Erdös; László A. Székely (J. Comb. Theory A, 2011)

Two-Part Set Systems. - Péter L. Erdös; Dániel Gerbner; Nathan Lemons; Dhruv Mubayi; Cory Palmer; Balázs Patkós (Electron. J. Comb., 2012)

On infinite-finite tree-duality pairs of relational structures - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (CoRR, 2012)

Efficient algorithms for the periodic subgraphs mining problem. - Alberto Apostolico; Péter L. Erdös; Ervin Györi; Zsuzsanna Lipták; Cinzia Pizzi (J. Discrete Algorithms, 2012)

A linear algorithm for string reconstruction in the reverse complement equivalence model. - Ferdinando Cicalese; Péter L. Erdös; Zsuzsanna Lipták (J. Discrete Algorithms, 2012)

Parameterized searching with mismatches for run-length encoded strings. - Alberto Apostolico; Péter L. Erdös; Alpár Jüttner (Theor. Comput. Sci., 2012)

Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. - István Miklós; Péter L. Erdös; Lajos Soukup (Electron. J. Comb., 2013)

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. - Péter L. Erdös; Zoltán Király; István Miklós (Comb. Probab. Comput., 2013)

Generating functions for multi-labeled trees. - Éva Czabarka; Péter L. Erdös; Virginia Johnson; Vincent Moulton (Discret. Appl. Math., 2013)

On Infinite-finite Duality Pairs of Directed Graphs. - Péter L. Erdös; Claude Tardif; Gábor Tardos (Order, 2013)

Caterpillar Dualities and Regular Languages. - Péter L. Erdös; Claude Tardif; Gábor Tardos (SIAM J. Discret. Math., 2013)

AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. - Harout K. Aydinian; Péter L. Erdös (Order, 2014)

Modulated string searching. - Alberto Apostolico; Péter L. Erdös; István Miklós; Johannes Siemons (Theor. Comput. Sci., 2014)

Exact sampling of graphs with prescribed degree correlations. - Kevin E. Bassler; Charo I. Del Genio; Péter L. Erdös; István Miklós; Zoltán Toroczkai (CoRR, 2015)

On realizations of a joint degree matrix. - Éva Czabarka; Aaron Dutle; Péter L. Erdös; István Miklós (Discret. Appl. Math., 2015)

A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. - Péter L. Erdös; István Miklós; Zoltán Toroczkai (SIAM J. Discret. Math., 2015)

The second order degree sequence problem is NP-complete. - Péter L. Erdös; István Miklós (CoRR, 2016)

Regular families of forests, antichains and duality pairs of relational structures. - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (Comb., 2017)

Graph Realizations Constrained by Skeleton Graphs. - Péter L. Erdös; Stephen G. Hartke; Leo van Iersel; István Miklós (Electron. J. Comb., 2017)

Exploring the tiers of rooted phylogenetic network space using tail moves. - Remie Janssen; Mark Jones 001; Péter L. Erdös; Leo van Iersel; Céline Scornavacca (CoRR, 2017)

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. - Péter L. Erdös; István Miklós; Zoltán Toroczkai (Comb. Probab. Comput., 2018)

Terminal-pairability in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Discret. Appl. Math., 2018)

The mixing time of the swap (switch) Markov chains: a unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (CoRR, 2019)

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (CoRR, 2019)

Navigating between packings of graphic sequences. - Péter L. Erdös; Michael Ferrara; Stephen G. Hartke (Discret. Appl. Math., 2019)

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Theor. Comput. Sci., 2019)

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (Electron. J. Comb., 2021)

Algorithms for Interference Minimization in Future Wireless Network Decomposition. - Péter L. Erdös; Tamás Róbert Mezei; Yiding Yu; Xiang Chen 010; Wei Han 004; Bo Bai 001 (CoRR, 2021)

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. - Péter L. Erdös; Andrew R. Francis; Tamás Róbert Mezei (Discret. Appl. Math., 2021)

Approximate Sampling of Graphs with Near-P-stable Degree Intervals. - Péter L. Erdös; Tamás Róbert Mezei; István Miklós (CoRR, 2022)

Minimizing interference-to-signal ratios in multi-cell networks. - Péter L. Erdös; Tamás Róbert Mezei (CoRR, 2022)

The mixing time of switch Markov chains: A unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (Eur. J. Comb., 2022)

On the Small Quasi-kernel conjecture. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (CoRR, 2023)

Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks. - Péter L. Erdös; Tamás Róbert Mezei (Algorithms, 2023)

Degree-preserving graph dynamics: a versatile process to construct random networks. - Péter L. Erdös; Shubha R. Kharel; Tamás Róbert Mezei; Zoltán Toroczkai (J. Complex Networks, 2023)

On the Small Quasi-kernel Conjecture - A Survey. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (Information Theory and Related Fields, 2025)

Fully graphic degree sequences and P-stable degree sequences. - Péter L. Erdös; István Miklós; Lajos Soukup (Adv. Appl. Math., 2025)