Email
gsarkozy@wpi.edu
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.
Email
gsarkozy@wpi.edu
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.
Office
Fuller Labs 134
Phone
+1 (508) 8315408
Research Interests
Graph theory
Discrete mathematics
Theoretical computer science
Scholarly Work
The 3-color Ramsey number of a 3-uniform Berge-cycle.'' Combinatorics, Probability and Computing 20, 2011, pp. 53-71 (with András Gyárfás).
Monochromatic cycle partitions of edge-colored graphs.'' Journal of Graph Theory 66, 2011, pp. 57-64.
Partitioning 3-colored complete graphs into three monochromatic cycles.'' Electronic Journal of Combinatorics 18, 2011, #P53 (with András Gyárfás, Miklós Ruszinkó and Endre Szemerédi).
Long rainbow cycles in proper edge-colorings of complete graphs.'' Australasian Journal of Combinatorics 50, 2011, pp. 45-53 (with András Gyárfás, Miklós Ruszinkó and Richard Schelp)
Vertex partitions of non-complete graphs by connected monochromatic k-regular graphs.'' Discrete Mathematics 311, 2011, pp. 279-284 (with Stanley Selkow and Fei Song)
Coverings by monochromatic pieces - problems for the Emlektabla workshop.'' Proceedings of the 3rd Emlektabla Workshop, Janos Bolyai Mathematical Society, 2011, pp. 1-9.
Professional Highlights & Honors
Good Teaching Award, 1995
University of Pennsylvania
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences, 2009