Péter L. Erdös

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 22

Top Topics

Bipartite Graph

Monte Carlo Method

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Theor. Comput. Sci.

Publications

Péter L. Erdös, István Miklós, Lajos Soukup
Fully graphic degree sequences and P-stable degree sequences. CoRR (2024)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
On the Small Quasi-kernel conjecture. CoRR (2023)
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
Degree-preserving graph dynamics: a versatile process to construct random networks. J. Complex Networks 11 (5) (2023)
Péter L. Erdös, Tamás Róbert Mezei
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks. Algorithms 16 (7) (2023)
Péter L. Erdös, Tamás Róbert Mezei, István Miklós
Approximate Sampling of Graphs with Near-P-stable Degree Intervals. CoRR (2022)
Péter L. Erdös, Tamás Róbert Mezei
Minimizing interference-to-signal ratios in multi-cell networks. CoRR (2022)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99 (2022)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. 28 (3) (2021)
Péter L. Erdös, Tamás Róbert Mezei, Yiding Yu, Xiang Chen, Wei Han, Bo Bai
Algorithms for Interference Minimization in Future Wireless Network Decomposition. CoRR (2021)
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
Degree-preserving graph dynamics - a versatile process to construct random networks. CoRR (2021)
Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. Discret. Appl. Math. 294 (2021)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR (2019)
Péter L. Erdös, Michael Ferrara, Stephen G. Hartke
Navigating between packings of graphic sequences. Discret. Appl. Math. 266 (2019)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR (2019)
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theor. Comput. Sci. 775 (2019)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. Comb. Probab. Comput. 27 (2) (2018)
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236 (2018)
Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós
Graph Realizations Constrained by Skeleton Graphs. Electron. J. Comb. 24 (2) (2017)
Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca
Exploring the tiers of rooted phylogenetic network space using tail moves. CoRR (2017)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37 (4) (2017)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
New classes of degree sequences with fast mixing swap Markov chain sampling. CoRR (2016)
Péter L. Erdös, István Miklós
The second order degree sequence problem is NP-complete. CoRR (2016)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. SIAM J. Discret. Math. 29 (1) (2015)
Kevin E. Bassler, Charo I. Del Genio, Péter L. Erdös, István Miklós, Zoltán Toroczkai
Exact sampling of graphs with prescribed degree correlations. CoRR (2015)
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
On realizations of a joint degree matrix. Discret. Appl. Math. 181 (2015)
Harout K. Aydinian, Péter L. Erdös
AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. Order 31 (1) (2014)
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
Modulated string searching. Theor. Comput. Sci. 525 (2014)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. CoRR (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On Infinite-finite Duality Pairs of Directed Graphs. Order 30 (3) (2013)
Éva Czabarka, Péter L. Erdös, Virginia Johnson, Vincent Moulton
Generating functions for multi-labeled trees. Discret. Appl. Math. 161 (1-2) (2013)
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
On Realizations of a Joint Degree Matrix CoRR (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar Dualities and Regular Languages. SIAM J. Discret. Math. 27 (3) (2013)
István Miklós, Péter L. Erdös, Lajos Soukup
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. Electron. J. Comb. 20 (1) (2013)
Péter L. Erdös, Zoltán Király, István Miklós
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. 22 (3) (2013)
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
Modulated String Searching CoRR (2013)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
On infinite-finite tree-duality pairs of relational structures CoRR (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On infinite-finite duality pairs of directed graphs CoRR (2012)
Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós
Two-Part Set Systems. Electron. J. Comb. 19 (1) (2012)
Alberto Apostolico, Péter L. Erdös, Alpár Jüttner
Parameterized searching with mismatches for run-length encoded strings. Theor. Comput. Sci. 454 (2012)
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
A linear algorithm for string reconstruction in the reverse complement equivalence model. J. Discrete Algorithms 14 (2012)
Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17 (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar dualities and regular languages CoRR (2012)
Péter L. Erdös, Zoltán Király, István Miklós
On the swap-distances of different realizations of a graphical degree sequence CoRR (2012)
Harout K. Aydinian, Péter L. Erdös
On two-part Sperner systems for regular posets (Extended Abstract). Electron. Notes Discret. Math. 38 (2011)
Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely
A tour of M-part L-Sperner families. J. Comb. Theory, Ser. A 118 (2) (2011)
Péter L. Erdös, Lajos Soukup, Jens Stoye
Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett. 24 (1) (2011)
Péter L. Erdös, Lajos Soukup, Jens Stoye
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance CoRR (2010)
Péter L. Erdös, Lajos Soukup
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. Order 27 (3) (2010)
Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48 (2010)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. Electron. J. Comb. 17 (1) (2010)
Alberto Apostolico, Péter L. Erdös, Alpár Jüttner
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). SPIRE (2010)
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
Efficient Reconstruction of RC-Equivalent Strings. IWOCA (2010)
Péter L. Erdös, Lajos Soukup
Quasi-kernels and quasi-sinks in infinite graphs. Discret. Math. 309 (10) (2009)
Péter L. Erdös, Lajos Soukup
How To Split Antichains In Infinite Posets. Comb. 27 (2) (2007)
Harout K. Aydinian, Péter L. Erdös
All Maximum Size Two-Part Sperner Systems: In Short. Comb. Probab. Comput. 16 (4) (2007)
Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
Parameterized matching with mismatches. J. Discrete Algorithms 5 (1) (2007)
Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney
Subwords in reverse-complement order. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona
-Sperner Families: New Proofs Using Permutations. SIAM J. Discret. Math. 19 (2) (2005)
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
Note on the game chromatic index of trees. Theor. Comput. Sci. 313 (3) (2004)
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
Exordium for DNA Codes. J. Comb. Optim. 7 (4) (2003)
Péter L. Erdös, Péter Sziklai, David C. Torney
A Finite Word Poset. Electron. J. Comb. 8 (2) (2001)
Péter L. Erdös, Ákos Seress, László A. Székely
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. Comb. 20 (1) (2000)
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14 (2) (1999)
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221 (1-2) (1999)
Péter L. Erdös, András Frank, László A. Székely
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87 (1-3) (1998)
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
Constructing Big Trees from Short Sequences. ICALP (1997)
Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
Intersecting Systems. Comb. Probab. Comput. 6 (2) (1997)
Péter L. Erdös
Splitting property in infinite posets. Discret. Math. 163 (1-3) (1997)
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Comput. Artif. Intell. 16 (2) (1997)
Péter L. Erdös, Ulrich Faigle, Walter Kern
On the average rank of LYM-sets. Discret. Math. 144 (1-3) (1995)
Rudolf Ahlswede, Péter L. Erdös, Niall Graham
A Splitting Property of Maximal Antichains. Comb. 15 (4) (1995)
Péter L. Erdös, László A. Székely
On weighted multiway cuts in trees. Math. Program. 65 (1994)
Péter L. Erdös, Ákos Seress, László A. Székely
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3 (1994)
Péter L. Erdös, László A. Székely
Counting Bichromatic Evolutionary Trees. Discret. Appl. Math. 47 (1) (1993)
Péter L. Erdös
A new bijection on rooted forests. Discret. Math. 111 (1-3) (1993)
Péter L. Erdös, László A. Székely
Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO (1992)
Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
Sharpening the LYM inequality. Comb. 12 (3) (1992)
Péter L. Erdös, Ulrich Faigle, Walter Kern
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1 (1992)
Konrad Engel, Péter L. Erdös
Polytopes determined by complementfree Sperner families. Discret. Math. 81 (2) (1990)
Konrad Engel, Péter L. Erdös
Sperner families satisfying additional conditions and their convex hulls. Graphs Comb. 5 (1) (1989)
Péter L. Erdös, Gyula O. H. Katona
Convex hulls of more-part Sperner families. Graphs Comb. 2 (1) (1986)
Péter L. Erdös, Gyula O. H. Katona
All maximum 2-part Sperner families. J. Comb. Theory, Ser. A 43 (1) (1986)
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
Extremal hypergraph problems and convex hulls. Comb. 5 (1) (1985)
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
Intersecting Sperner families and their convex hulls. Comb. 4 (1) (1984)
Péter L. Erdös, Zoltán Füredi
On Automorphisms of Line-graphs. Eur. J. Comb. 1 (4) (1980)