Email
gsarkozy@wpi.edu
Office
Fuller Labs 134
Phone
+1 (508) 8315408
Education
BS Eotvos University 1990
MS Rutgers University 1994
PhD Rutgers University 1994
Postdoc University of Pennsylvania 1994-96

My research interests are in graph theory, discrete mathematics, and theoretical computer science. I am especially interested in studying the structure of very large graphs,; an area that is getting more and more important these days. I enjoy teaching at WPI; in particular, I enjoy the project experience. I am the founder and director of the Budapest Project Center, the first and only WPI Project Center in Eastern Europe. I love sports, especially tennis and soccer.

Scholarly Work

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)

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).

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)

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).

Corrigendum: Three color Ramsey numbers for paths'' (Combinatorica 27 (1), 2007, pp. 35-69). Combinatorica 28 (4), 2008, pp. 499-502 (with András Gyárfás, Miklós Ruszinkó and Endre Szemerédi),

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).

Professional Highlights & Honors
Good Teaching Award, 1995
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences, 2009