Miklós Ruszinkó

2008
21	EE	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-color Ramsey numbers for paths. Combinatorica 28(4): 499-502 (2008)
20	EE	Zoltán Füredi, Miklós Ruszinkó: Large convex cones in hypercubes. Discrete Applied Mathematics 156(9): 1536-1541 (2008)
2007
19	EE	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-Color Ramsey Numbers For Paths. Combinatorica 27(1): 35-69 (2007)
18	EE	Alan M. Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth: Codes identifying sets of vertices in random networks. Discrete Mathematics 307(9-10): 1094-1107 (2007)
17	EE	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Tripartite Ramsey numbers for paths. Journal of Graph Theory 55(2): 164-174 (2007)
16	EE	Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth: Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007)
2006
15	EE	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96(6): 855-873 (2006)
2005
14	EE	Zoltán Füredi, Miklós Ruszinkó: Large Convex Cones in Hypercubes. Electronic Notes in Discrete Mathematics 21: 283-284 (2005)
2003
13	EE	Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10: (2003)
2002
12	EE	Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the maximum size of (p, Q)-free families. Discrete Mathematics 257(2-3): 385-403 (2002)
2001
11	EE	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Vertex Covers by Edge Disjoint Cliques. Combinatorica 21(2): 171-197 (2001)
10		Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families. Combinatorics, Probability & Computing 10(5): (2001)
9	EE	Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the Maximum Size of (p, Q) - free Families. Electronic Notes in Discrete Mathematics 10: 247-249 (2001)
8	EE	Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó: Anti-Ramsey Colorings in Several Rounds. J. Comb. Theory, Ser. B 82(1): 1-18 (2001)
2000
7	EE	Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: A Note on Random Minimum Length Spanning Trees. Electr. J. Comb. 7: (2000)
6	EE	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Note on Sparse Random Graphs and Cover Graphs. Electr. J. Comb. 7: (2000)
1999
5		Zoltán Füredi, Miklós Ruszinkó: An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. IEEE Transactions on Information Theory 45(2): 799-802 (1999)
1998
4	EE	Paul Erdös, András Gyárfás, Miklós Ruszinkó: How to decrease the diameter of triangle-free graphs. Combinatorica 18(4): 493-501 (1998)
1997
3		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)
2	EE	Noga Alon, Miklós Ruszinkó: Short Certificates for Tournaments. Electr. J. Comb. 4(1): (1997)
1994
1		Miklós Ruszinkó: On the Upper Bound of the Size of the r-Cover-Free Families. J. Comb. Theory, Ser. A 66(2): 302-310 (1994)

Coauthor Index

1	Rudolf Ahlswede	[3]
2	Noga Alon	[2] [3]
3	Aart Blokhuis	[8]
4	Tom Bohman	[6] [10] [11] [13] [16]
5	Colin Cooper	[13]
6	Paul Erdös	[4]
7	Péter L. Erdös	[3]
8	Ralph J. Faudree	[8]
9	Alan M. Frieze	[6] [7] [10] [11] [13] [16] [18]
10	Zoltán Füredi	[5] [9] [12] [14] [20]
11	András Gyárfás	[4] [8] [9] [12] [15] [17] [19] [21]
12	Ryan Martin	[13] [16] [18]
13	Julien Moncel	[18]
14	Gábor N. Sárközy	[15] [17] [19] [21]
15	Clifford D. Smyth	[16] [18]
16	László A. Székely	[3]
17	Endre Szemerédi	[15] [17] [19] [21]
18	Lubos Thoma	[6] [7] [10] [11]