List of publications and papers available on-line

Combinatorics

Convex hull of set systems

P.L. Erdős - P. Frankl - G.O.H. Katona: Intersecting Sperner families and their convex hulls, Combinatorica4 (1984), 21-34.
P.L. Erdős - P. Frankl - G.O.H. Katona: Extremal hypergraphs problems and convex hulls, Combinatorica 5 (1985), 11-26.
P.L. Erdős - G.O.H. Katona: Convex hulls of more-part Sperner families, Graphs and Combinatorics 2 (1986), 123-134.
P.L. Erdős - G.O.H. Katona: All maximum 2-part Sperner families, J. Combinatorial Theory (A) 43 (1986), 58-69.
P.L. Erdős - G.O.H. Katona: A 3-part Sperner theorem, Studia Scientiarum Mathematicarum Hungarica 22 (1987), 383-393.
K. Engel - P.L. Erdős: Sperner families satisfying additional conditions and their convex hulls, Graphs and Combinatorics 5 (1988), 50-59.
K. Engel - P.L. Erdős: Polytopes determined by complementfree Sperner families, Discrete Mathematics 81 (1990), 165-169.
P.L. Erdős - Z. Füredi - G.O.H. Katona: Two part and k-Sperner families - new proofs using permutations, SIAM J. Disc. Math. 19 (2005), 489--500.
H. Aydinian - P.L. Erdős: All maximum size 2-part Sperner systems - in short, Combinatorics, Probability and Computing 16 (2007), 553-555.
H. Aydinian - É. Czabarka - P.L. Erdős - L.A. Székely: A tour of M-part L-Sperner families, J. Comb. Theory (A) 118 (2011), 702-–725.

Other papers in extremal set and poset theory

P.L. Erdős - P. Frankl - D.J. Kleitman - M. Saks - L.A. Székely: Sharpening the LYM inequality, Combinatorica 12 (1992) 295-301.
P.L. Erdős - U. Faigle - W. Kern: A group-theoretic setting for some intersecting Sperner families, Combinatorics, Probability and Computing 1 (1992), 323-334.
P.L. Erdős - Á. Seress - L.A. Székely: On intersecting chains in Boolean algebras, Combinatorics, Probability and Computing 3 (1994), 57--62.
P.L. Erdős - U. Faigle - W. Kern: On the average rank of LYM-sets, Discrete Mathematics 144 (1995), 11-22.
P.L. Erdős - L.A. Székely: Pseudo-LYM inequality and AZ identities, Advances Applied Mathematics 19 (1997), 431-443.
P.L. Erdős - Á. Seress - L.A. Székely: On intersecting chains in Boolean algebras, in Combinatorics, geometry and probability (ed. B. Bollobás, A. Thomason) (Cambridge, 1993), Cambridge Univ. Press, Cambridge, 1997. 299--304. Second release
P.L. Erdős - Á. Seress - L.A. Székely: Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets, Combinatorica 20 (2000), 27--45.
P.L. Erdős - L.A. Székely: Erdős-Ko-Rado theorems of higher order, in Numbers, Information and Complexity, (I. Althöfer, Ning Cai, G. Dueck, L. Khachatrian, M. S. Pinsker, A. Sárközy, I. Wegener and Zhen Zhang (eds.)), Kluwer Academic Publishers (2000), 117--124.
R. Ahlswede - N. Alon - P.L. Erdős - M. Ruszinko - L.A. Székely:Intersecting systems, Combinatorics, Probability and Computing 6 (2) (1997), 127--137.
P.L. Erdős - Á. Seress - L.A. Székely: Non-trivial t-intersection in the function lattice, Annals of Combinatorics 9 (2005), 177--187.
H. Aydinian - É. Czabarka - K. Engel - P.L. Erdős - L.A. Székely: A note on full transversals and mixed orthogonal arrays, Australian J. Combinatorics 48 (2010), 133--141.
A. Aydinian - P.L. Erdős: On two-part Sperner systems for regular posets - Extended Abstract, in Proc. EUROCOMB'11 -- Elect. Notes Disc. Math. 38 (2011), 87--92.
P.L. Erdős - D. Gerbner - D. Mubayi - N. Lemons - C. Palmer - B. Patkós: Two-part set systems, to appear in Elec. J. Combin. (2012), 1--11.
A. Aydinian - P.L. Erdős: AZ-identities and Strict 2-part Sperner Properties of Product Posets Order (2013), 1--15. DOI 10.1007/s11083-012-9284-y

Splitting property and duality pairs

P.L. Erdős - Niall Graham: On maximal Sperner families, DIMACS Technical Report, Rutgers University, New Jersey, USA No. 93-42 July, 1993
R. Ahlswede - P.L. Erdős - Niall Graham: A splitting property of maximal antichains, Combinatorica 15 (1995), 475-480.
P.L. Erdős: Splitting property in infinite posets, Discrete Mathematics 163 (1997), 251--256.
P.L. Erdős: Some generalizations of property B and the splitting property, Annals of Combinatorics 3 (1999), 53--59.
P.L. Erdős - L. Soukup: How to split antichains in infinite posets, Combinatorica 27 (2007), 147--161.
D. Duffus - P.L. Erdős - J. Nesetril - L. Soukup: Antichains in the homomorphism order of graphs, Comment Math Univ Carolinae 48 (2007), 571-583. Long version
P.L. Erdős - L. Soukup: Antichains and duality pairs in the digraph-poset, extended abstract, Proceedings of the ROGICS 08 (Editors: Y. Boudabbous, N. Zaguia) (2008), 327-332.
P.L. Erdős - L. Soukup: No finite-infinite antichain duality in the homomorphism poset of directed graphs, ORDER 27 (3) (2010), 317-325.
P.L. Erdős - C. Tardif - G. Tardos: On infinite-finite duality pairs of directed graphs, Order (2012), 1--14. doi:10.1007/s11083-012-9278-9
P.L. Erdős - C. Tardif - G. Tardos: Caterpillar dualities and regular languages, submitted (2012), 1-8.
P.L. Erdős - D. Pálvölgyi - C. Tardif - G. Tardos: On infinite-finite tree-duality pairs of relational structures, submitted (2012), 1--18.

Multiway cut problem

P.L. Erdős - L. A. Székely: Evolutionary trees: an integer multicommodity max-flow -- min-cut theorem, Advances in Applied Math 13 (1992) 375-389.
P.L. Erdős - L.A. Székely: Algorithms and min-max theorems for certain multiway cuts, Integer Programming and Combinatorial Optimization (Proc. of a Conf. held at Carnegie Mellon University, May 25-27, 1992, by the Math. Programming Society, ed. by E. Balas, G. Cornuéjols, R. Kannan) 334-345.
P.L. Erdős - L. A. Székely: On weighted multiway cuts in trees, Mathematical Programming 65 (1994), 93-105.
P.L. Erdős - A. Frank - L.A. Székely: Minimum multiway cuts in trees, Discrete Applied Mathematics 87 (1998), 67--75.

Degree sequences

Hyunju Kim - Z. Toroczkai - I. Miklós - P.L. Erdős - L.A. Székely: Degree-based graph construction, Journal of Physics: Math. Theor. A 42 (2009), 392001 (10pp)
P.L. Erdős - I. Miklós - Z. Toroczkai: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs, Elec. J. Combin. 17 (1) (2010), R66 (10pp).
I. Miklós - P.L. Erdős - S. Soukup: Towards random uniform sampling of bipartite graphs with given degree sequence, Elec. J. Combin. 20 (1) (2013), Article 16 pp. 1--51.
P.L. Erdős - Z. Király - I. Miklós: On the swap-distances of different realizations of a graphical degree sequence, Combinatorics, Probability and Computing (2013), 1--30. DOI 10.1007/s11083-012-9284-y
P.L. Erdős - S. Kiss - I. Miklós - L. Soukup: Constructing, sampling and counting graphical realizations of restricted degree sequences submitted (2013), 1--24.
É. Czabarka - A. Dutle - P.L. Erdős - I. Miklós:, On Realizations of a Joint Degree Matrix submitted (2013), 1--12.

Enumerative combinatorics

P.L. Erdős - L.A. Székely: Applications of antilexicographical order I. An enumerative theory of trees, Advances in Applied Mathematics} 10 (1989), 488--496.
P.L. Erdős: A new bijection on rooted forests, Discrete Mathematics 111 (1993), 179--188.
P.L. Erdős - L. A. Székely: Counting bichromatic evolutionary trees, Discrete Applied Mathematics 47 (1993), 1--8.
É. Czabarka - P.L. Erdős - V. Johnson - A. Kupczok - L.A. Székely: Asymptotically normal distribution of some tree families relevant for phylogenetics, and of partitions without singletons, Moscow Journal of Combinatorics and Number Theory 1 (3) (2011), 220--232.
É. Czabarka - P.L. Erdős - V. Johnson - V. Moulton: Generating Functions for Multi-labeled Trees, Disc. Appl. Math. 161 (2013), 107--117.

String problems

P.L. Erdős - P. Sziklai - D. C. Torney: A finite word poset, Electr. J. Combinatorics 8 No 2. (2001), Article 8
A.W.M. Dress - P.L. Erdős: Reconstructing Words from Subwords in Linear Time, Annals of Combinatorics 7 (2004), 457--462
P.L. Erdős - P. Ligeti - P. Sziklai - D. C. Torney: Subwords in reverse-complement order, Annals of Combinatorics 10 (2006), 415--430.
A. Apostolico - P.L. Erdős - M. Lewenstein: Parameterized Matching with Mismatches, J. Discrete Algorithms 5 (2007), 135--140.
F. Cicalese - P.L. Erdős - Zs. Lipták: Efficient Reconstruction of RC-Equivalent Strings IWOCA 2010, LNCS 6460 (2010), 349--362.
A. Apostolico - P.L. Erdős - A. Jüttner: Parameterized Searching with Mismatches for Run-Length Encoded Strings (Extended Abstract) SPIRE 2010, LNCS 6393 (2010), 365--371.
F. Cicalese - P.L. Erdős - Zs. Lipták: Efficient Reconstruction of RC-Equivalent Strings over Arbitrary Paired Alphabets, J. Discrete Algorithms 14 (2012), 37--54.
A. Apostolico - P.L. Erdős - A. Jüttner: Parameterized Searching with Mismatches for Run-Length Encoded Strings, Theoretical Comp. Sci.} 454 (2012), 23--29. doi:10.1016/j.tcs.2012.03.018}
A. Apostolico - P.L. Erdős - E. Győri - Zs. Lipták - C. Pizzi: Efficient Algorithms for the Periodic Subgraphs Mining Problem, J. Discrete Algorithms 17 (2012), 24--30. .
A. Apostolico - P.L. Erdős - I. Miklós - J. Siemons: Modulated String Searching, submitted (2013), 1--10.

Others

Erdős Péter: A Ramsey-type theorem (in Hungarian), Matematikai Lapok, 27 (1976--79), 361--364. Abstract (in english)
P.L. Erdős - Z. Füredi: On automorphisms of line-graphs, Europ. J. Combinatorics 1 (1980), 341-345.
P.L. Erdős - E. Győri: Any four independent edges of a 4-connected graph are contained in a circuit. Acta Math. Sci. Hung. 46 (1985), 311-313.
P.L. Erdős: On the reconstruction of combinatorial structures from line-graphs, Studia Scientiarum Math. Hung 29 (1994), 341-347.
P.L. Erdős - U. Faigle - W. Hochstatter - W. Kern: Note on the Game Chromatic Index of Trees, Theoretical Computer Science (Special Issue on Algorithmic Combinatorial Game Theory) 313 (2004), 371--376.
P.L. Erdős - S. Soukup: Quasi-kernels and quasi-sinks in infinite graphs, Disc.Math. 309 (2009), 3040--3048.

Bioinformatics

Hadamard conjugation for evolutionary trees and invariants

M.A. Steel - M.D. Hendy - L.A. Székely - P.L. Erdős : Spectral analysis and a closest tree method for genetic sequences, Appl. Math. Letters 5 (1992), 63-67.
L.A. Székely - P.L. Erdős - M.A. Steel: The combinatorics of evolutionary trees--a survey, Séminaire Lotharingien de Combinatoire, (Saint-Nabor, 1992), D. Foata, éd, Publ. Inst. Rech. Math. Av. 498 (1992), 129--143.
L.A. Székely - P.L. Erdős - M.A. Steel - D. Penny: A Fourier inversion formula for evolutionary trees, Appl. Math. Letters 6 (1993), 13-17.
L.A. Székely - M. Steel - P.L. Erdős: Fourier calculus on evolutionary trees, Advances in Appl. Math 14 (1993), 200-216.
M.A. Steel - L.A. Székely - P.L. Erdős - P. Waddell: A complete family of phylogenetic invariants for any number of taxa, New Zealand Journal of Botany, 31 (1993), 289-296.
L.A. Székely - P.L. Erdős - M.A. Steel: The combinatorics of reconstructing evolutionary trees, J. Comb. Math. Comb. Computing 15 (1994), 241-254.

Short Quartet Methods

M.A. Steel - L.A. Székely - P.L. Erdős: The number of nucleotide sites needed to accurately reconstruct large evolutionary trees, DIMACS, Rutgers University, New Brunswick, New Jersey, USA 1996. DIMACS TR 96-19
P.L. Erdős - M.A. Steel - L.A. Székely - T.J. Warnow: Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule, Computers and Artificial Intelligence 16 (1997), 217-227.
P.L. Erdős - K. Rice - M.A. Steel - L.A. Székely - T.J. Warnow: The Short Quartet Method, to appear in Math. Modelling and Sci. Computing Special Issue of the papers presented at the Computational Biology sessions at the 11th ICMCM, March 31 - April 2, 1997, Georgetown University Conference Center, Washington, D.C., USA.
P.L. Erdős - M.A. Steel - L.A. Székely - T.J. Warnow: Constructing big trees from short sequences, Automata, Languages and Programming 24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, (P. Degano,; R. Gorrieri, A. Marchetti-Spaccamela, Eds.) Proceedings (LNCS 1256) (1997), 827-837.
P.L. Erdős - M.A. Steel - L.A. Székely - T.J. Warnow: A few logs suffice to build (almost) all trees (I), Random Structures and Algorithms 14 (1999), 153-184.
P.L. Erdős - M.A. Steel - L.A. Székely - T.J. Warnow: A few logs suffice to build (almost) all trees (II), Theoretical Computer Science 221 (1-2) (1999), 77--118.

Others

A.W.M. Dress - P.L. Erdős: X-trees and Weighted Quartet Systems, Annals Combinatorics 7 (2003), 155-169
A.G. D'yachkov - P.L. Erdős - A.J. Macula - V.V. Rykov - D.C. Torney - C-S. Tung - P.A. Vilenkin - P. Scott White: Exordium for DNA Codes, J. Combinatorial Optimization 7 (2003), 396--397.
P.L. Erdős - S. Soukup - J. Stoye: Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance, to appear in {\sl Appl. Math. Letters} (2010), 1--6.