Fully graphic degree sequences and P-stable degree sequences.

Péter L. Erdös Alfréd Rényi Institute of Mathematics, Budapest, Hungary http://www.renyi.hu/~elp/ https://zbmath.org/authors/?q=ai:erdos.peter-l https://orcid.org/0000-0002-1139-2316

Péter L. Erdös István Miklós Lajos Soukup Fully graphic degree sequences and P-stable degree sequences. 102805 2025 163 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2024.102805 db/journals/aam/aam163.html#ErdosMS25 streams/journals/aam

Péter L. Erdös Ervin Györi Tamás Róbert Mezei Nika Salia Mykhaylo Tyomkyn On the Small Quasi-kernel Conjecture - A Survey. 98-110 2025 Information Theory and Related Fields https://doi.org/10.1007/978-3-031-82014-4_4 conf/birthday/2025cai db/conf/birthday/cai2025.html#ErdosGMST25

Péter L. Erdös István Miklós Lajos Soukup Fully graphic degree sequences and P-stable degree sequences. 2024 abs/2405.12013 CoRR https://doi.org/10.48550/arXiv.2405.12013 db/journals/corr/corr2405.html#abs-2405-12013

Péter L. Erdös Tamás Róbert Mezei Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks. 341 2023 July 16 Algorithms 7 https://doi.org/10.3390/a16070341 db/journals/algorithms/algorithms16.html#ErdosM23

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. 2023 September 11 J. Complex Networks 5 https://doi.org/10.1093/comnet/cnad046 db/journals/compnet/compnet11.html#ErdosKMT23

Péter L. Erdös Ervin Györi Tamás Róbert Mezei Nika Salia Mykhaylo Tyomkyn On the Small Quasi-kernel conjecture. 2023 abs/2307.04112 CoRR https://doi.org/10.48550/arXiv.2307.04112 db/journals/corr/corr2307.html#abs-2307-04112

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. 103421 2022 99 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2021.103421 db/journals/ejc/ejc99.html#ErdosGMMSS22

Péter L. Erdös Tamás Róbert Mezei István Miklós Approximate Sampling of Graphs with Near-P-stable Degree Intervals. 2022 abs/2204.09493 CoRR https://doi.org/10.48550/arXiv.2204.09493 db/journals/corr/corr2204.html#abs-2204-09493

Péter L. Erdös Tamás Róbert Mezei Minimizing interference-to-signal ratios in multi-cell networks. 2022 abs/2212.10129 CoRR https://doi.org/10.48550/arXiv.2212.10129 db/journals/corr/corr2212.html#abs-2212-10129

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. 3 2021 28 Electron. J. Comb. 3 https://doi.org/10.37236/9652 db/journals/combinatorics/combinatorics28.html#ErdosGMMS21

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. 205-213 2021 294 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2021.02.016 db/journals/dam/dam294.html#ErdosFM21

Péter L. Erdös Tamás Róbert Mezei Yiding Yu Xiang Chen 0010 Wei Han 0004 Bo Bai 0001 Algorithms for Interference Minimization in Future Wireless Network Decomposition. 2021 abs/2111.00885 CoRR https://arxiv.org/abs/2111.00885 db/journals/corr/corr2111.html#abs-2111-00885

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. 2021 abs/2111.11994 CoRR https://arxiv.org/abs/2111.11994 db/journals/corr/corr2111.html#abs-2111-11994

Péter L. Erdös Michael Ferrara Stephen G. Hartke Navigating between packings of graphic sequences. 252-258 2019 266 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.06.034 db/journals/dam/dam266.html#ErdosFH19

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. 16-25 2019 775 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.12.007 https://www.wikidata.org/entity/Q128766521 db/journals/tcs/tcs775.html#ColucciEGM19

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. 2019 abs/1903.06600 CoRR http://arxiv.org/abs/1903.06600 db/journals/corr/corr1903.html#abs-1903-06600

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. 2019 abs/1909.02308 CoRR http://arxiv.org/abs/1909.02308 db/journals/corr/corr1909.html#abs-1909-02308

Péter L. Erdös István Miklós Zoltán Toroczkai New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. 186-207 2018 27 Comb. Probab. Comput. 2 https://doi.org/10.1017/S0963548317000499 db/journals/cpc/cpc27.html#ErdosMT18

Lucas Colucci Péter L. Erdös Ervin Györi Tamás Róbert Mezei Terminal-pairability in complete bipartite graphs. 459-463 2018 236 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.10.026 db/journals/dam/dam236.html#ColucciEGM18

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. 651-672 2017 37 Comb. 4 https://doi.org/10.1007/s00493-015-3003-4 db/journals/combinatorica/combinatorica37.html#ErdosPTT17

Péter L. Erdös Stephen G. Hartke Leo van Iersel István Miklós Graph Realizations Constrained by Skeleton Graphs. 2 2017 24 Electron. J. Comb. 2 https://doi.org/10.37236/5459 db/journals/combinatorics/combinatorics24.html#ErdosHIM17

Remie Janssen Mark Jones 0001 Péter L. Erdös Leo van Iersel Céline Scornavacca Exploring the tiers of rooted phylogenetic network space using tail moves. 2017 abs/1708.07656 CoRR http://arxiv.org/abs/1708.07656 db/journals/corr/corr1708.html#abs-1708-07656

Péter L. Erdös István Miklós Zoltán Toroczkai New classes of degree sequences with fast mixing swap Markov chain sampling. 2016 abs/1601.08224 CoRR http://arxiv.org/abs/1601.08224 db/journals/corr/corr1601.html#ErdosMT16

Péter L. Erdös István Miklós The second order degree sequence problem is NP-complete. 2016 abs/1606.00730 CoRR http://arxiv.org/abs/1606.00730 db/journals/corr/corr1606.html#ErdosM16

Éva Czabarka Aaron Dutle Péter L. Erdös István Miklós On realizations of a joint degree matrix. 283-288 2015 181 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.10.012 db/journals/dam/dam181.html#CzabarkaDEM15

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. 481-499 2015 29 SIAM J. Discret. Math. 1 https://doi.org/10.1137/130929874 db/journals/siamdm/siamdm29.html#ErdosMT15

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. 2015 abs/1503.06725 CoRR http://arxiv.org/abs/1503.06725 db/journals/corr/corr1503.html#BasslerGEMT15

Harout K. Aydinian Péter L. Erdös AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. 1-14 2014 31 Order 1 https://doi.org/10.1007/s11083-012-9284-y db/journals/order/order31.html#AydinianE14

Alberto Apostolico Péter L. Erdös István Miklós Johannes Siemons Modulated string searching. 23-29 2014 525 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.10.013 db/journals/tcs/tcs525.html#ApostolicoEMS14

István Miklós Péter L. Erdös Lajos Soukup Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. 16 2013 20 Electron. J. Comb. 1 https://doi.org/10.37236/3028 db/journals/combinatorics/combinatorics20.html#MiklosES13

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. 366-383 2013 22 Comb. Probab. Comput. 3 https://doi.org/10.1017/S0963548313000096 db/journals/cpc/cpc22.html#ErdosKM13

Éva Czabarka Péter L. Erdös Virginia Johnson Vincent Moulton Generating functions for multi-labeled trees. 107-117 2013 161 Discret. Appl. Math. 1-2 https://doi.org/10.1016/j.dam.2012.08.010 https://www.wikidata.org/entity/Q41455295 db/journals/dam/dam161.html#CzabarkaEJM13

Péter L. Erdös Claude Tardif Gábor Tardos On Infinite-finite Duality Pairs of Directed Graphs. 807-819 2013 30 Order 3 https://doi.org/10.1007/s11083-012-9278-9 db/journals/order/order30.html#ErdosTT13

Péter L. Erdös Claude Tardif Gábor Tardos Caterpillar Dualities and Regular Languages. 1287-1294 2013 27 SIAM J. Discret. Math. 3 https://doi.org/10.1137/120879270 db/journals/siamdm/siamdm27.html#ErdosTT13

Alberto Apostolico Péter L. Erdös István Miklós Johannes Siemons Modulated String Searching http://arxiv.org/abs/1302.3437 2013 CoRR abs/1302.3437 db/journals/corr/corr1302.html#abs-1302-3437

Éva Czabarka Aaron Dutle Péter L. Erdös István Miklós On Realizations of a Joint Degree Matrix http://arxiv.org/abs/1302.3548 2013 CoRR abs/1302.3548 db/journals/corr/corr1302.html#abs-1302-3548

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. 2013 CoRR http://arxiv.org/abs/1307.5295 abs/1307.5295 db/journals/corr/corr1307.html#ErdosMT13

Péter L. Erdös Dániel Gerbner Nathan Lemons Dhruv Mubayi Cory Palmer Balázs Patkós Two-Part Set Systems. 52 2012 19 Electron. J. Comb. 1 https://doi.org/10.37236/2067 db/journals/combinatorics/combinatorics19.html#ErdosGLMPP12

Ferdinando Cicalese Péter L. Erdös Zsuzsanna Lipták A linear algorithm for string reconstruction in the reverse complement equivalence model. 37-54 2012 14 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2011.12.003 db/journals/jda/jda14.html#CicaleseEL12

Alberto Apostolico Péter L. Erdös Ervin Györi Zsuzsanna Lipták Cinzia Pizzi Efficient algorithms for the periodic subgraphs mining problem. 24-30 2012 17 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2012.05.002 db/journals/jda/jda17.html#ApostolicoEGLP12

Alberto Apostolico Péter L. Erdös Alpár Jüttner Parameterized searching with mismatches for run-length encoded strings. 23-29 2012 454 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.03.018 db/journals/tcs/tcs454.html#ApostolicoEJ12

Péter L. Erdös Claude Tardif Gábor Tardos On infinite-finite duality pairs of directed graphs http://arxiv.org/abs/1203.1257 2012 CoRR abs/1203.1257 db/journals/corr/corr1203.html#abs-1203-1257

Péter L. Erdös Claude Tardif Gábor Tardos Caterpillar dualities and regular languages http://arxiv.org/abs/1203.1347 2012 CoRR abs/1203.1347 db/journals/corr/corr1203.html#abs-1203-1347

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 http://arxiv.org/abs/1205.2842 2012 CoRR abs/1205.2842 db/journals/corr/corr1205.html#abs-1205-2842

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 http://arxiv.org/abs/1207.4402 2012 CoRR abs/1207.4402 db/journals/corr/corr1207.html#abs-1207-4402

Péter L. Erdös Lajos Soukup Jens Stoye Balanced vertices in trees and a simpler algorithm to compute the genomic distance. 82-86 2011 24 Appl. Math. Lett. 1 https://doi.org/10.1016/j.aml.2010.08.021 db/journals/appml/appml24.html#ErdosSS11

Harout K. Aydinian Péter L. Erdös On two-part Sperner systems for regular posets (Extended Abstract). 87-92 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.015 db/journals/endm/endm38.html#AydinianE11

Harout K. Aydinian Éva Czabarka Péter L. Erdös László A. Székely A tour of M-part L-Sperner families. 702-725 2011 118 J. Comb. Theory A 2 https://doi.org/10.1016/j.jcta.2010.09.006 db/journals/jct/jcta118.html#AydinianCES11

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. 133-142 2010 48 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/48/ajc_v48_p133.pdf db/journals/ajc/ajc48.html#AydinianCEES10

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. 2010 17 Electron. J. Comb. 1 https://doi.org/10.37236/338 db/journals/combinatorics/combinatorics17.html#ErdosMT10

Péter L. Erdös Lajos Soukup No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. 317-325 2010 27 Order 3 https://doi.org/10.1007/s11083-009-9118-8 db/journals/order/order27.html#ErdosS10

Ferdinando Cicalese Péter L. Erdös Zsuzsanna Lipták Efficient Reconstruction of RC-Equivalent Strings. 349-362 2010 IWOCA https://doi.org/10.1007/978-3-642-19222-7_35 conf/iwoca/2010 db/conf/iwoca/iwoca2010.html#CicaleseEL10 Alberto Apostolico Péter L. Erdös Alpár Jüttner Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). 365-371 2010 SPIRE https://doi.org/10.1007/978-3-642-16321-0_38 conf/spire/2010 db/conf/spire/spire2010.html#ApostolicoEJ10

Péter L. Erdös Lajos Soukup Jens Stoye Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance http://arxiv.org/abs/1004.2735 2010 CoRR abs/1004.2735 db/journals/corr/corr1004.html#abs-1004-2735

Péter L. Erdös Lajos Soukup Quasi-kernels and quasi-sinks in infinite graphs. 3040-3048 2009 309 Discret. Math. 10 https://doi.org/10.1016/j.disc.2008.08.006 db/journals/dm/dm309.html#ErdosS09

Péter L. Erdös Lajos Soukup How To Split Antichains In Infinite Posets. 147-161 2007 27 Comb. 2 https://doi.org/10.1007/s00493-007-0048-z db/journals/combinatorica/combinatorica27.html#ErdosS07

Harout K. Aydinian Péter L. Erdös All Maximum Size Two-Part Sperner Systems: In Short. 553-555 2007 16 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548306007930 db/journals/cpc/cpc16.html#AydinianE07

Alberto Apostolico Péter L. Erdös Moshe Lewenstein Parameterized matching with mismatches. 135-140 2007 5 J. Discrete Algorithms 1 https://doi.org/10.1016/j.jda.2006.03.014 db/journals/jda/jda5.html#ApostolicoEL07

Péter L. Erdös Péter Ligeti Péter Sziklai David C. Torney Subwords in reverse-complement order. 2006 Combinatorial and Algorithmic Foundations of Pattern and Association Discovery http://drops.dagstuhl.de/opus/volltexte/2006/785 conf/dagstuhl/2006P6201 db/conf/dagstuhl/P6201.html#ErdosLST06

Péter L. Erdös Zoltán Füredi Gyula O. H. Katona Two-Part and <i>k</i>-Sperner Families: New Proofs Using Permutations. 489-500 2005 19 SIAM J. Discret. Math. 2 https://doi.org/10.1137/S0895480104443588 db/journals/siamdm/siamdm19.html#ErdosFK05

Péter L. Erdös Ulrich Faigle Winfried Hochstättler Walter Kern Note on the game chromatic index of trees. 371-376 2004 313 Theor. Comput. Sci. 3 https://doi.org/10.1016/j.tcs.2002.10.002 db/journals/tcs/tcs313.html#ErdosFHK04

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. 369-379 2003 7 J. Comb. Optim. 4 https://doi.org/10.1023/B:JOCO.0000017385.39168.0d db/journals/jco/jco7.html#DyachkovEMRTTVW03

Péter L. Erdös Péter Sziklai David C. Torney A Finite Word Poset. 2001 8 Electron. J. Comb. 2 https://doi.org/10.37236/1607 db/journals/combinatorics/combinatorics8.html#ErdosST01

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. 27-45 2000 20 Comb. 1 https://doi.org/10.1007/s004930070029 db/journals/combinatorica/combinatorica20.html#ErdosSS00

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). 153-184 1999 14 Random Struct. Algorithms 2 db/journals/rsa/rsa14.html#ErdsSSW99 https://doi.org/10.1002/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R

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. 77-118 1999 221 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs221.html#ErdosSSW99 https://doi.org/10.1016/S0304-3975(99)00028-6

Péter L. Erdös András Frank László A. Székely Minimum Multiway Cuts in Trees. 67-75 1998 87 Discret. Appl. Math. 1-3 https://doi.org/10.1016/S0166-218X(98)00049-3 db/journals/dam/dam87.html#ErdosFS98

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. 1997 16 Comput. Artif. Intell. 2 db/journals/cai/cai16.html#ErdosSSW97 http://www.cai.sk/ojs/index.php/cai/article/view/669 217-227

Rudolf Ahlswede Noga Alon Péter L. Erdös Miklós Ruszinkó László A. Székely Intersecting Systems. 127-137 1997 6 Comb. Probab. Comput. 2 db/journals/cpc/cpc6.html#AhlswedeAERS97 http://journals.cambridge.org/action/displayAbstract?aid=46519

Péter L. Erdös Splitting property in infinite posets. 251-256 1997 163 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(96)00010-6 https://www.wikidata.org/entity/Q127473198 db/journals/dm/dm163.html#Erdos97

Péter L. Erdös Mike A. Steel László A. Székely Tandy J. Warnow Constructing Big Trees from Short Sequences. 827-837 1997 conf/icalp/1997 ICALP db/conf/icalp/icalp97.html#ErdosSSW97 https://doi.org/10.1007/3-540-63165-8_235

Rudolf Ahlswede Péter L. Erdös Niall Graham A Splitting Property of Maximal Antichains. 475-480 1995 15 Comb. 4 db/journals/combinatorica/combinatorica15.html#AhlswedeEG95 https://doi.org/10.1007/BF01192520

Péter L. Erdös Ulrich Faigle Walter Kern On the average rank of LYM-sets. 11-22 1995 144 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(94)00282-N db/journals/dm/dm144.html#ErdosFK95

Péter L. Erdös Ákos Seress László A. Székely On Intersecting Chains in Boolean Algebras. 57-62 1994 3 Comb. Probab. Comput. db/journals/cpc/cpc3.html#ErdosSS94 https://doi.org/10.1017/S0963548300000973

Péter L. Erdös László A. Székely On weighted multiway cuts in trees. 93-105 1994 65 Math. Program. db/journals/mp/mp65.html#ErdosS94 https://doi.org/10.1007/BF01581691

Péter L. Erdös László A. Székely Counting Bichromatic Evolutionary Trees. 1-8 1993 47 Discret. Appl. Math. 1 db/journals/dam/dam47.html#ErdosS93 https://doi.org/10.1016/0166-218X(93)90147-G

Péter L. Erdös A new bijection on rooted forests. 179-188 1993 111 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(93)90154-L db/journals/dm/dm111.html#Erdos93

Péter L. Erdös Peter Frankl Daniel J. Kleitman Michael E. Saks László A. Székely Sharpening the LYM inequality. 287-293 1992 12 Comb. 3 db/journals/combinatorica/combinatorica12.html#ErdosFKSS92 https://doi.org/10.1007/BF01285817

Péter L. Erdös Ulrich Faigle Walter Kern A Group-Theoretic Setting for Some Intersecting Sperner Families. 323-334 1992 1 Comb. Probab. Comput. db/journals/cpc/cpc1.html#ErdosFK92 https://doi.org/10.1017/S0963548300000377

Péter L. Erdös László A. Székely Algorithms and Min-max Theorems for Certain Multiway Cuts. 334-345 1992 conf/ipco/1992 IPCO db/conf/ipco/ipco1992.html#ErdosS92

Konrad Engel Péter L. Erdös Polytopes determined by complementfree Sperner families. 165-169 1990 81 Discret. Math. 2 https://doi.org/10.1016/0012-365X(90)90148-B db/journals/dm/dm81.html#EngelE90

Konrad Engel Péter L. Erdös Sperner families satisfying additional conditions and their convex hulls. 47-56 1989 5 Graphs Comb. 1 https://doi.org/10.1007/BF01788657 db/journals/gc/gc5.html#EngelE89

Péter L. Erdös Gyula O. H. Katona Convex hulls of more-part Sperner families. 123-134 1986 2 Graphs Comb. 1 https://doi.org/10.1007/BF01788086 db/journals/gc/gc2.html#ErdosK86

Péter L. Erdös Gyula O. H. Katona All maximum 2-part Sperner families. 58-69 1986 43 J. Comb. Theory A 1 https://doi.org/10.1016/0097-3165(86)90023-3 db/journals/jct/jcta43.html#ErdosK86

Péter L. Erdös Peter Frankl Gyula O. H. Katona Extremal hypergraph problems and convex hulls. 11-26 1985 5 Comb. 1 db/journals/combinatorica/combinatorica5.html#ErdosFK85 https://doi.org/10.1007/BF02579438

Péter L. Erdös Peter Frankl Gyula O. H. Katona Intersecting Sperner families and their convex hulls. 21-34 1984 4 Comb. 1 db/journals/combinatorica/combinatorica4.html#ErdosFK84 https://doi.org/10.1007/BF02579153

Péter L. Erdös Zoltán Füredi On Automorphisms of Line-graphs. 341-345 1980 1 Eur. J. Comb. 4 https://doi.org/10.1016/S0195-6698(80)80035-7 db/journals/ejc/ejc1.html#ErdosF80

Rudolf Ahlswede Noga Alon Alberto Apostolico Harout K. Aydinian Bo Bai 0001 Kevin E. Bassler Xiang Chen 0010 Ferdinando Cicalese Lucas Colucci Éva Czabarka Aaron Dutle Arkadii G. D'yachkov Konrad Engel Ulrich Faigle Michael Ferrara Andrew R. Francis András Frank Peter Frankl Zoltán Füredi Charo I. Del Genio Dániel Gerbner Niall Graham Catherine S. Greenhill Ervin Györi Wei Han 0004 Stephen G. Hartke Winfried Hochstättler Leo van Iersel Remie Janssen Virginia Johnson Mark Jones 0001 Alpár Jüttner Gyula O. H. Katona Walter Kern Shubha R. Kharel Zoltán Király Daniel J. Kleitman Nathan Lemons Moshe Lewenstein Péter Ligeti Zsuzsanna Lipták Anthony J. Macula Tamás Róbert Mezei István Miklós Vincent Moulton Dhruv Mubayi Cory Palmer Dömötör Pálvölgyi Balázs Patkós Cinzia Pizzi Miklós Ruszinkó Vyacheslav V. Rykov Michael E. Saks Nika Salia Céline Scornavacca Ákos Seress Johannes Siemons Daniel Soltész Lajos Soukup Mike A. SteelMichael Anthony Steel Jens Stoye László A. Székely Péter Sziklai Claude Tardif Gábor Tardos David C. Torney Zoltán Toroczkai Chang-Shung Tung Mykhaylo Tyomkyn Pavel A. Vilenkin Tandy J. Warnow P. Scott White Yiding Yu