Péter L. Erdös

	2007
30		Péter L. Erdös, Lajos Soukup: How To Split Antichains In Infinite Posets. Combinatorica 27(2): 147-161 (2007)
29		Harout K. Aydinian, Péter L. Erdös: All Maximum Size Two-Part Sperner Systems: In Short. Combinatorics, Probability & Computing 16(4): 553-555 (2007)
28		Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein: Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007)
	2006
27		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
26		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. Discrete Math. 19(2): 489-500 (2005)
	2004
25		Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern: Note on the game chromatic index of trees. Theor. Comput. Sci. 303(3): 371-376 (2004)
	2003
24		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
23		Péter L. Erdös, Péter Sziklai, David C. Torney: A Finite Word Poset. Electr. J. Comb. 8(2): (2001)
	2000
22		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. Combinatorica 20(1): 27-45 (2000)
	1999
21		Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14(2): 153-184 (1999)
20		Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221(1-2): 77-118 (1999)
	1998
19		Péter L. Erdös, András Frank, László A. Székely: Minimum Multiway Cuts in Trees. Discrete Applied Mathematics 87(1-3): 67-75 (1998)
	1997
18		Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Constructing Big Trees from Short Sequences. ICALP 1997: 827-837
17		Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely: Intersecting Systems. Combinatorics, Probability & Computing 6(2): 127-137 (1997)
16		Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Computers and Artificial Intelligence 16(2): (1997)
15		Péter L. Erdös: Splitting property in infinite posets. Discrete Mathematics 163(1-3): 251-256 (1997)
	1995
14		Rudolf Ahlswede, Péter L. Erdös, Niall Graham: A Splitting Property of Maximal Antichains. Combinatorica 15(4): 475-480 (1995)
13		Péter L. Erdös, Ulrich Faigle, Walter Kern: On the average rank of LYM-sets. Discrete Mathematics 144(1-3): 11-22 (1995)
	1994
12		Péter L. Erdös, Ákos Seress, László A. Székely: On Intersecting Chains in Boolean Algebras. Combinatorics, Probability & Computing 3: 57-62 (1994)
11		Péter L. Erdös, László A. Székely: On weighted multiway cuts in trees. Math. Program. 65: 93-105 (1994)
	1993
10		Péter L. Erdös, László A. Székely: Counting Bichromatic Evolutionary Trees. Discrete Applied Mathematics 47(1): 1-8 (1993)
9		Péter L. Erdös: A new bijection on rooted forests. Discrete Mathematics 111(1-3): 179-188 (1993)
	1992
8		Péter L. Erdös, László A. Székely: Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO 1992: 334-345
7		Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely: Sharpening the LYM inequality. Combinatorica 12(3): 287-293 (1992)
6		Péter L. Erdös, Ulrich Faigle, Walter Kern: A Group-Theoretic Setting for Some Intersecting Sperner Families. Combinatorics, Probability & Computing 1: 323-334 (1992)
	1990
5		Konrad Engel, Péter L. Erdös: Polytopes determined by complementfree Sperner families. Discrete Mathematics 81(2): 165-169 (1990)
	1986
4		Péter L. Erdös, Gyula O. H. Katona: All maximum 2-part Sperner families. J. Comb. Theory, Ser. A 43(1): 58-69 (1986)
	1985
3		Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Extremal hypergraph problems and convex hulls. Combinatorica 5(1): 11-26 (1985)
	1984
2		Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Intersecting Sperner families and their convex hulls. Combinatorica 4(1): 21-34 (1984)
	1982
1		Péter L. Erdös, Peter Frankl, Zoltán Füredi: Families of Finite Sets in Which No Set Is Covered by the Union of Two Others. J. Comb. Theory, Ser. A 33(2): 158-166 (1982)

Coauthor Index

1	Rudolf Ahlswede	[14] [17]
2	Noga Alon	[17]
3	Alberto Apostolico	[28]
4	Harout K. Aydinian	[29]
5	Arkadii G. D'yachkov	[24]
6	Konrad Engel	[5]
7	Ulrich Faigle	[6] [13] [25]
8	András Frank	[19]
9	Peter Frankl	[1] [2] [3] [7]
10	Zoltán Füredi	[1] [26]
11	Niall Graham	[14]
12	Winfried Hochstättler	[25]
13	Gyula O. H. Katona	[2] [3] [4] [26]
14	Walter Kern	[6] [13] [25]
15	Daniel J. Kleitman	[7]
16	Moshe Lewenstein	[28]
17	Péter Ligeti	[27]
18	Anthony J. Macula	[24]
19	Miklós Ruszinkó	[17]
20	Vyacheslav V. Rykov	[24]
21	Michael E. Saks	[7]
22	Ákos Seress	[12] [22]
23	Lajos Soukup	[30]
24	Mike A. Steel (Michael Anthony Steel)	[16] [18] [20] [21]
25	László A. Székely	[7] [8] [10] [11] [12] [16] [17] [18] [19] [20] [21] [22]
26	Péter Sziklai	[23] [27]
27	David C. Torney	[23] [24] [27]
28	Chang-Shung Tung	[24]
29	Pavel A. Vilenkin	[24]
30	Tandy Warnow	[16] [18] [20] [21]
31	P. Scott White	[24]

Colors in the list of coauthors