2011.

Long rainbow cycles in proper edge-colorings of complete graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Schelp, Richard
Date: 2011.
Published by: Australasian Journal of Combinatorics (Volume no.: 50, Page: 45-53)

2010.

How to avoid using the Regularity Lemma: Pósa's conjecture revisited.

Authors: Levitt, Ian; Sárközy, Gábor; Szemeredi, Endre
Date: 2010.
Published by: Discrete Mathematics (Volume no.: 310, Page: 630-641.)

Gallai colorings of non-complete graphs.

Authors: Gyárfás, András; Sárközy, Gábor
Date: 2010.
Published by: Discrete Mathematics (Volume no.: 310, Page: 977-980.)

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Journal of Graph Theory (Volume no.: 63, Page: 288-299.)

Long monochromatic Berge cycles in colored 4-uniform hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Graphs and Combinatorics (Volume no.: 26, Page: 71-76.)

Ramsey-type results for Gallai colorings.

Authors: Gyárfás, András; Sárközy, Gábor; Sebő, András; Selkow, S.
Date: 2010.
Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 3, Page: 233-243.)

Monochromatic matchings in the shadow graph of almost complete hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Annals of Combinatorics (Volume no.: 14, Issue no.: 2, Page: 245-249.)

2009.

Stability of the path-path Ramsey number.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2009.
Published by: Discrete Mathematics (Volume no.: 309, Page: 4590-4595)

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.

Authors: Sárközy, Gábor
Date: 2009.
Published by: Discrete Mathematics (Volume no.: 309, Page: 1611-1622.)

2008.

Size of monochromatic components in local edge colorings.

Authors: Gyárfás , András; Sárközy , Gábor
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Issue no.: 12, Page: 2620-2622.)

On 2-factors with k components.

Authors: Sárközy , Gábor
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Issue no.: 10, Page: 1962-1972.)

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

Authors: Gyárfás, András; Lehel, Jenő; Sárközy, Gábor; Schelp, Richard
Date: 2008.
Published by: Journal of Combinatorial Theory. Ser. B. (Volume no.: 98, Issue no.: 2, Page: 342-358.)

Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.

Authors: Dorbec, Paul; Gravier, Sylvain; Sárközy, Gábor
Date: 2008.
Published by: Journal of Graph Theory (Volume no.: 59, Issue no.: 1, Page: 34-44.)

Distributing vertices along a Hamiltonian cycle in Dirac graphs.

Authors: Sárközy, Gábor; Selkow, Stanley
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Issue no.: 23, Page: 5757-5770.)

The Ramsey number of diamond matchings and loose cycles in hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemeredi , Endre
Date: 2008.
Published by: Electronic Journal of Combinatorics (Volume no.: 15, Page: #R126)

Inequalities for the first-fit chromatic number.

Authors: Füredi, Zoltán; Gyárfás, András; Sárközy, Gábor; Selkow, Stanley
Date: 2008.
Published by: Journal of Graph Theory (Volume no.: 59, Page: 75-88.)

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi , Endre
Date: 2008.
Published by: Combinatorica (Volume no.: 28, Issue no.: 4, Page: 499-502.)

Size of Monochromatic double stars in edge colorings

Authors: Gyárfás, András; Sárközy, Gábor
Date: 2008.
Published by: Graphs and Combinatorics (Volume no.: 24, Page: 531-536)

2007.

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Combinatorica (Volume no.: 27, Issue no.: 1, Page: 35-69.)

Tripartite Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 55, Issue no.: 2, Page: 164-174.)

2006.

On an anti-Ramsey problem of Burr, Erds, Graham, and T. Sós

Authors: Sárközy, Gábor; Selkow, S
Date: 2006.
Published by: Journal of Graph Theory (Volume no.: 52, Issue no.: 2, Page: 147-156)
Download article: [pdf]

An improved bound for the monochromatic cycle partition number

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Date: 2006.
Published by: Journal of Combinatorial Theory Series B (Volume no.: 96, Issue no.: 6, Page: 855-873)
Download article: [pdf]

One-sided coverings of colored complete bipartite graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Editor: Klazar, M
Date: 2006.
Published by: Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. (Algorithms and combinatorics 26.) (Page: 133-154)

2005.

On the size of partial block designs with large blocks

Authors: Sárközy, A; Sárközy, GN
Date: 2005.
Published by: DISCRETE MATHEMATICS (Volume no.: 305, Issue no.: 1-3, Page: 264-275)

An extension of the Ruzsa-Szemerédi theorem

Authors: Sárközy, GN; Selkow, S
Date: 2005.
Published by: COMBINATORICA (Volume no.: 25, Issue no.: 1, Page: 77-84)
Download article: [pdf]

On a Turán-type hypergraph problem of Brown, Erdős and T. Sós

Authors: Sárközy, GN; Seklow, S
Date: 2005.
Published by: DISCRETE MATHEMATICS (Volume no.: 297, Issue no.: 1-3, Page: 190-195)