Miklós Ruszinkó

Miklós Ruszinkó: Large components in r-edge-colorings of K_n have diameter at most five. Journal of Graph Theory 69(3): 337-340 (2012)

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electr. J. Comb. 18(1) (2011)

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)

Zoltán Füredi, Miklós Ruszinkó: Large convex cones in hypercubes. Discrete Applied Mathematics 156(9): 1536-1541 (2008)

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)

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)

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)

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)

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)

Zoltán Füredi, Miklós Ruszinkó: Large Convex Cones in Hypercubes. Electronic Notes in Discrete Mathematics 21: 283-284 (2005)

Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10 (2003)

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)

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Vertex Covers by Edge Disjoint Cliques. Combinatorica 21(2): 171-197 (2001)

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families. Combinatorics, Probability & Computing 10(5): 367-384 (2001)

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)

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)

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Note on Sparse Random Graphs and Cover Graphs. Electr. J. Comb. 7 (2000)

Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: A Note on Random Minimum Length Spanning Trees. Electr. J. Comb. 7 (2000)

Noga Alon, András Gyárfás, Miklós Ruszinkó: Decreasing the diameter of bounded degree graphs. Journal of Graph Theory 35(3): 161-172 (2000)

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)

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)

Noga Alon, Miklós Ruszinkó: Short Certificates for Tournaments. Electr. J. Comb. 4(1) (1997)

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)

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)