default search action
Péter L. Erdös
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i21]Péter L. Erdös, István Miklós, Lajos Soukup:
Fully graphic degree sequences and P-stable degree sequences. CoRR abs/2405.12013 (2024) - 2023
- [j60]Péter L. Erdös
, Tamás Róbert Mezei
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks. Algorithms 16(7): 341 (2023) - [j59]Péter L. Erdös, Shubha R. Kharel
Degree-preserving graph dynamics: a versatile process to construct random networks. J. Complex Networks 11(5) (2023) - [i20]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia
On the Small Quasi-kernel conjecture. CoRR abs/2307.04112 (2023) - 2022
- [j58]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: 103421 (2022) - [i19]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 abs/2204.09493 (2022) - [i18]Péter L. Erdös, Tamás Róbert Mezei:
Minimizing interference-to-signal ratios in multi-cell networks. CoRR abs/2212.10129 (2022) - 2021
- [j57]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): 3 (2021) - [j56]Péter L. Erdös
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. Discret. Appl. Math. 294: 205-213 (2021) - [i17]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 abs/2111.00885 (2021) - [i16]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 abs/2111.11994 (2021)
2010 – 2019
- 2019
- [j55]Péter L. Erdös
Navigating between packings of graphic sequences. Discret. Appl. Math. 266: 252-258 (2019) - [j54]Lucas Colucci, Péter L. Erdös
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theor. Comput. Sci. 775: 16-25 (2019) - [i15]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 abs/1903.06600 (2019) - [i14]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 abs/1909.02308 (2019) - 2018
- [j53]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): 186-207 (2018) - [j52]Lucas Colucci, Péter L. Erdös
Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236: 459-463 (2018) - 2017
- [j51]Péter L. Erdös, Dömötör Pálvölgyi
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37(4): 651-672 (2017) - [j50]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): 2 (2017) - [i13]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 abs/1708.07656 (2017) - 2016
- [i12]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 abs/1601.08224 (2016) - [i11]Péter L. Erdös, István Miklós:
The second order degree sequence problem is NP-complete. CoRR abs/1606.00730 (2016) - 2015
- [j49]Éva Czabarka
On realizations of a joint degree matrix. Discret. Appl. Math. 181: 283-288 (2015) - [j48]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): 481-499 (2015) - [i10]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 abs/1503.06725 (2015) - 2014
- [j47]Harout K. Aydinian, Péter L. Erdös:
AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. Order 31(1): 1-14 (2014) - [j46]Alberto Apostolico, Péter L. Erdös
Modulated string searching. Theor. Comput. Sci. 525: 23-29 (2014) - 2013
- [j45]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): 16 (2013) - [j44]Péter L. Erdös, Zoltán Király
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. 22(3): 366-383 (2013) - [j43]Éva Czabarka
Generating functions for multi-labeled trees. Discret. Appl. Math. 161(1-2): 107-117 (2013) - [j42]Péter L. Erdös, Claude Tardif, Gábor Tardos
On Infinite-finite Duality Pairs of Directed Graphs. Order 30(3): 807-819 (2013) - [j41]Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar Dualities and Regular Languages. SIAM J. Discret. Math. 27(3): 1287-1294 (2013) - [i9]Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons:
Modulated String Searching. CoRR abs/1302.3437 (2013) - [i8]Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós:
On Realizations of a Joint Degree Matrix. CoRR abs/1302.3548 (2013) - [i7]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 abs/1307.5295 (2013) - 2012
- [j40]Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer
Two-Part Set Systems. Electron. J. Comb. 19(1): 52 (2012) - [j39]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: 37-54 (2012) - [j38]Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17: 24-30 (2012) - [j37]Alberto Apostolico, Péter L. Erdös, Alpár Jüttner:
Parameterized searching with mismatches for run-length encoded strings. Theor. Comput. Sci. 454: 23-29 (2012) - [i6]Péter L. Erdös, Claude Tardif, Gábor Tardos:
On infinite-finite duality pairs of directed graphs. CoRR abs/1203.1257 (2012) - [i5]Péter L. Erdös, Claude Tardif, Gábor Tardos:
Caterpillar dualities and regular languages. CoRR abs/1203.1347 (2012) - [i4]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 abs/1205.2842 (2012) - [i3]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 abs/1207.4402 (2012) - 2011
- [j36]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): 82-86 (2011) - [j35]Harout K. Aydinian, Péter L. Erdös:
On two-part Sperner systems for regular posets (Extended Abstract). Electron. Notes Discret. Math. 38: 87-92 (2011) - [j34]Harout K. Aydinian, Éva Czabarka
A tour of M-part L-Sperner families. J. Comb. Theory A 118(2): 702-725 (2011) - 2010
- [j33]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: 133-142 (2010) - [j32]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) - [j31]Péter L. Erdös, Lajos Soukup:
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. Order 27(3): 317-325 (2010) - [c4]Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
Efficient Reconstruction of RC-Equivalent Strings. IWOCA 2010: 349-362 - [c3]Alberto Apostolico, Péter L. Erdös, Alpár Jüttner:
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). SPIRE 2010: 365-371 - [i2]Péter L. Erdös, Lajos Soukup, Jens Stoye:
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. CoRR abs/1004.2735 (2010)
2000 – 2009
- 2009
- [j30]Péter L. Erdös, Lajos Soukup:
Quasi-kernels and quasi-sinks in infinite graphs. Discret. Math. 309(10): 3040-3048 (2009) - 2007
- [j29]Péter L. Erdös, Lajos Soukup:
How To Split Antichains In Infinite Posets. Comb. 27(2): 147-161 (2007) - [j28]Harout K. Aydinian, Péter L. Erdös:
All Maximum Size Two-Part Sperner Systems: In Short. Comb. Probab. Comput. 16(4): 553-555 (2007) - [j27]Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein:
Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007) - 2006
- [i1]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 - 2005
- [j26]Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona:
Two-Part and k-Sperner Families: New Proofs Using Permutations. SIAM J. Discret. Math. 19(2): 489-500 (2005) - 2004
- [j25]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): 371-376 (2004) - 2003
- [j24]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): 369-379 (2003) - 2001
- [j23]Péter L. Erdös, Péter Sziklai, David C. Torney:
A Finite Word Poset. Electron. J. Comb. 8(2) (2001) - 2000
- [j22]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): 27-45 (2000)
1990 – 1999
- 1999
- [j21]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): 153-184 (1999) - [j20]Péter L. Erdös, Michael Anthony Steel
A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221(1-2): 77-118 (1999) - 1998
- [j19]Péter L. Erdös, András Frank, László A. Székely:
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87(1-3): 67-75 (1998) - 1997
- [j18]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): 217-227 (1997) - [j17]Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely:
Intersecting Systems. Comb. Probab. Comput. 6(2): 127-137 (1997) - [j16]Péter L. Erdös:
Splitting property in infinite posets. Discret. Math. 163(1-3): 251-256 (1997) - [c2]Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow:
Constructing Big Trees from Short Sequences. ICALP 1997: 827-837 - 1995
- [j15]Rudolf Ahlswede, Péter L. Erdös, Niall Graham:
A Splitting Property of Maximal Antichains. Comb. 15(4): 475-480 (1995) - [j14]Péter L. Erdös, Ulrich Faigle, Walter Kern:
On the average rank of LYM-sets. Discret. Math. 144(1-3): 11-22 (1995) - 1994
- [j13]Péter L. Erdös, Ákos Seress, László A. Székely:
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3: 57-62 (1994) - [j12]Péter L. Erdös, László A. Székely:
On weighted multiway cuts in trees. Math. Program. 65: 93-105 (1994) - 1993
- [j11]Péter L. Erdös, László A. Székely:
Counting Bichromatic Evolutionary Trees. Discret. Appl. Math. 47(1): 1-8 (1993) - [j10]Péter L. Erdös:
A new bijection on rooted forests. Discret. Math. 111(1-3): 179-188 (1993) - 1992
- [j9]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): 287-293 (1992) - [j8]Péter L. Erdös, Ulrich Faigle, Walter Kern:
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1: 323-334 (1992) - [c1]Péter L. Erdös, László A. Székely:
Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO 1992: 334-345 - 1990
- [j7]Konrad Engel, Péter L. Erdös:
Polytopes determined by complementfree Sperner families. Discret. Math. 81(2): 165-169 (1990)
1980 – 1989
- 1989
- [j6]Konrad Engel, Péter L. Erdös:
Sperner families satisfying additional conditions and their convex hulls. Graphs Comb. 5(1): 47-56 (1989) - 1986
- [j5]Péter L. Erdös, Gyula O. H. Katona:
Convex hulls of more-part Sperner families. Graphs Comb. 2(1): 123-134 (1986) - [j4]Péter L. Erdös, Gyula O. H. Katona:
All maximum 2-part Sperner families. J. Comb. Theory A 43(1): 58-69 (1986) - 1985
- [j3]Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Extremal hypergraph problems and convex hulls. Comb. 5(1): 11-26 (1985) - 1984
- [j2]Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Intersecting Sperner families and their convex hulls. Comb. 4(1): 21-34 (1984) - 1980
- [j1]Péter L. Erdös, Zoltán Füredi:
On Automorphisms of Line-graphs. Eur. J. Comb. 1(4): 341-345 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: