[1] ``On a problem of P. Erdos.'' Acta Mathematica Hungarica, 60 (1-2), 1992, pp. 271-282.
[2] ``Cycles in bipartite graphs and an application in Number Theory.'' Journal of Graph Theory, 19 (3), 1995, pp. 323-331.
[3] ``On sums with small prime factors.'' Acta Mathematica Hungarica, 67 (4), 1995, pp. 333-345.
[4] ``Proof of a packing conjecture of Bollobas.'' Combinatorics, Probability and Computing, 4, 1995, pp. 241-255 (with János Komlós, Endre Szemerédi).
[5] ``On the square of a Hamiltonian cycle in dense graphs.'' Random Structures and Algorithms, 9, 1996, pp. 193-211 (with János Komlós, Endre Szemerédi).
[6] ``On cycles in the coprime graph of integers.'' Electronic Journal of Combinatorics, 4 (2), 1997, #R8 (with Paul Erdos). ( pdf file)
[7] ``Blow-up Lemma.'' Combinatorica, 17 (1), 1997, pp. 109-123 (with János Komlós, Endre Szemerédi). ( pdf file)
[8] ``An algorithmic version of the Blow-up Lemma.'' Random Structures and Algorithms, 12, 1998, pp. 297-312 (with János Komlós, Endre Szemerédi). ( pdf file)
[9] ``On the Pósa-Seymour conjecture.'' Journal of Graph Theory, 29, 1998, pp. 167-176 (with János Komlós, Endre Szemerédi). ( pdf file)
[10] ``Proof of the Seymour conjecture for large graphs.'' Annals of Combinatorics, 1, 1998, pp. 43-60 (with János Komlós, Endre Szemerédi). ( pdf file)
[11] ``Counting irregular multigraphs.'' Discrete Mathematics, 195, 1999, pp. 235-237 (with Aron Atkins and Stanley Selkow). ( pdf file)
[12] ``Complete tripartite subgraphs in the coprime graph of integers.'' Discrete Mathematics, 202, 1999, pp. 227-238. ( pdf file)
[13] ``On k-ordered Hamiltonian graphs.'' Journal of Graph Theory 32, 1999, pp. 17-25 (with Hal Kierstead, Stanley Selkow). ( pdf file)
[14] ``Vertex partitions by connected monochromatic k-regular graphs.'' Journal of Combinatorial Theory Series B, 78, 2000, pp. 115-122 (with Stanley Selkow). ( pdf file)
[15] ``On edge colorings with at least q colors in every subset of p vertices.'' Electronic Journal of Combinatorics 8, 2001, #R9 (with Stanley Selkow). ( pdf file)
[16] ``Spanning trees in dense graphs.'' Combinatorics, Probability and Computing 10, 2001, pp. 397-416 (with János Komlós, Endre Szemerédi). ( pdf file)
[17] ``Proof of the Alon-Yuster conjecture.'' Discrete Mathematics 235, 2001, pp. 255-269 (with János Komlós, Endre Szemerédi). ( pdf file)
[18] ``On the number of Hamiltonian cycles in Dirac graphs.'' Discrete Mathematics 265, 2003, pp. 237-250 (with Stanley Selkow, Endre Szemerédi). ( pdf file)
[19] ``On bipartite generalized Ramsey theory.'' Ars Combinatoria 68, 2003, pp. 57-64 (with Stanley Selkow).
[20] ``An application of the Regularity Lemma in generalized Ramsey theory.'' Journal of Graph Theory 44, 2003, pp. 39-49 (with Stanley Selkow). ( pdf file)
[21] ``An extension of the Ruzsa-Szemerédi Theorem.'' Combinatorica 25 (1), 2005, pp. 77-84 (with Stanley Selkow). ( pdf file)
[22] ``On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.'' Discrete Mathematics 297, 2005, pp. 190-195 (with Stanley Selkow). ( pdf file)
[23] ``On partial block designs with large blocks.'' Discrete Mathematics 305, 2005, pp. 264-275 (with András Sárközy). ( pdf file)
[24] ``On an anti-Ramsey problem of Burr, Erdos, Graham and T. Sós.'' Journal of Graph Theory 52, 2006, pp. 147-156 (with Stanley Selkow). ( pdf file)
[25] ``An improved bound for the monochromatic cycle partition number.'' Journal of Combinatorial Theory, Ser. B 96, 2006, pp.855-873 (with András Gyárfás, Miklós Ruszinkó and Endre Szemerédi). ( pdf file)
[26] ``One-sided coverings of colored complete bipartite graphs.'' in Topics in Discrete Mathematics (dedicated to J. Nesetril on his 6oth birthday), Algorithms and Combinatorics 26 (M. Klazar et al eds.), Springer, Berlin, 2006, pp. 133-154. (with András Gyárfás, Miklós Ruszinkó and Endre Szemerédi). ( ps file)
[27] ``Three color Ramsey numbers for paths.''
Combinatorica 27 (1), 2007, pp. 35-69
(with András Gyárfás, Miklós Ruszinkó and
Endre Szemerédi),
(
pdf file)
Corrigendum, Combinatorica 28 (4), 2008, pp. 499-502
(
pdf file)
[28] ``Tripartite Ramsey numbers for paths.'' Journal of Graph Theory 55, 2007, pp. 164-174 (with András Gyárfás, Miklós Ruszinkó and Endre Szemerédi). ( pdf file)
[29] ``Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.'' Journal of Combinatorial Theory, Ser. B 98, 2008, pp. 342-358 (with András Gyárfás, Jeno Lehel and Richard Schelp). ( pdf file)
[30] ``On 2-factors with k components.'' Discrete Mathematics 308, 2008, pp. 1962-1972. ( pdf file)
[31] ``Size of monochromatic components in local edge colorings.'' Discrete Mathematics 308, 2008, pp. 2620-2622 (with András Gyárfás). ( pdf file)
[32] ``Inequalities for the First-Fit chromatic number.'' Journal of Graph Theory 59, 2008, pp. 75-88 (with Zoltán Furedi, András Gyárfás and Stanley Selkow). ( pdf file)
[33] ``Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.'' Journal of Graph Theory 59, 2008, pp. 34-44 (with Paul Dorbec and Sylvain Gravier). ( pdf file)
[34] ``Distributing vertices along a Hamiltonian cycle in Dirac graphs.'' Discrete Mathematics 308, 2008, pp. 5757-5770 (with Stanley Selkow). ( pdf file)
[35] ``The Ramsey number of diamond-matchings and loose cycles in hypergraphs.'' Electronic Journal of Combinatorics 15 (1), 2008, #R126 (with András Gyárfás and Endre Szemerédi). ( pdf file)
[36] ``Size of monochromatic double stars in edge colorings.'' Graphs and Combinatorics 24, 2008, pp. 531-536 (with András Gyárfás). ( pdf file)
[37] ``A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.'' Discrete Mathematics 309, 2009, pp. 1611-1622. ( pdf file)
[38] ``Multipartite Ramsey numbers for odd cycles.'' Journal of Graph Theory 61, 2009, pp. 12-21 (with András Gyárfás and Richard Schelp). ( pdf file)
[39] ``Stability of the path-path Ramsey number.'' Discrete Mathematics 309, 2009, pp. 4590-4595 (with András Gyárfás and Endre Szemerédi). ( pdf file)
[40] ``How to avoid using the Regularity Lemma; Pósa's Conjecture revisited.'' Accepted for publication in Discrete Mathematics (with Ian Levitt and Endre Szemerédi). ( pdf file)
[41] ``Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.'' Accepted for publication in the Journal of Graph Theory (with András Gyárfás and Endre Szemerédi). ( pdf file)
[42] ``Monochromatic matchings in the shadow graph of almost complete hypergraphs.'' Accepted for publication in Annals of Combinatorics (with András Gyárfás and Endre Szemerédi). ( pdf file)
[43] ``Ramsey-type results for Gallai-colorings.'' Accepted for publication in the Journal of Graph Theory (with András Gyárfás, András Sebo and Stanley Selkow). ( pdf file)
[44] ``The 3-color Ramsey number of a 3-uniform Berge-cycle.'' Accepted for publication in Combinatorics, Probability and Computing (with András Gyárfás). ( pdf file)
[45] ``Gallai colorings of non-complete graphs.'' Accepted for publication in Discrete Mathematics (with András Gyárfás). ( pdf file)
[46] ``Long monochromatic Berge cycles in colored 4-unform hypergraphs.'' Accepted for publication in Graphs and Combinatorics (with András Gyárfás and Endre Szemerédi). ( pdf file)
[47] ``Monochromatic cycle partitions of edge-colored graphs.'' Submitted for publication to the Journal of Graph Theory. ( pdf file)
[48] ``Paths and cycles with many colors in edge-colored complete graphs.'' Submitted for publication to Discrete Mathematics (with András Gyárfás, Miklós Ruszinkó and Richard Schelp). ( pdf file)