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
Office Location
Fuller Labs 134
Contact
Phone:
+1 (508) 8315408
Research Interests
Research Interests:
Graph theory
Discrete mathematics
Theoretical computer science
Scholarly Work
On k-ordered Hamiltonian graphs.'' Journal of Graph Theory 32, 1999, pp. 17-25 (with Hal Kierstead, Stanley Selkow)
Vertex partitions by connected monochromatic k-regular graphs.'' Journal of Combinatorial Theory Series B, 78, 2000, pp. 115-122 (with Stanley Selkow).
On edge colorings with at least q colors in every subset of p vertices.'' Electronic Journal of Combinatorics 8, 2001, #R9 (with Stanley Selkow).
Spanning trees in dense graphs.'' Combinatorics, Probability and Computing 10, 2001, pp. 397-416 (with János Komlós, Endre Szemerédi).
Proof of the Alon-Yuster conjecture.'' Discrete Mathematics 235, 2001, pp. 255-269 (with János Komlós, Endre Szemerédi)
On the number of Hamiltonian cycles in Dirac graphs.'' Discrete Mathematics 265, 2003, pp. 237-250 (with Stanley Selkow, Endre Szemerédi).
Professional Highlights & Honors
Professional Highlights & Honors:
William Smith Dean’s Professor
1991
Rutgers University
Good Teaching Award
1995
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences
2009
Board Member
2012
European Journal of Combinatorics