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
Size of monochromatic components in local edge colorings.'' Discrete Mathematics 308, 2008, pp. 2620-2622 (with András Gyárfás)
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).
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.'' Journal of Graph Theory 59, 2008, pp. 34-44 (with Paul Dorbec and Sylvain Gravier).
Distributing vertices along a Hamiltonian cycle in Dirac graphs.'' Discrete Mathematics 308, 2008, pp. 5757-5770 (with Stanley Selkow).
Size of monochromatic double stars in edge colorings.'' Graphs and Combinatorics 24, 2008, pp. 531-536 (with András Gyárfás).
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.'' Discrete Mathematics 309, 2009, pp. 1611-1622
Professional Highlights & Honors
Good Teaching Award, 1995
University of Pennsylvania
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences, 2009