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.
Research Interests
Graph theory
Discrete mathematics
Theoretical computer science
Scholarly Work
On the Pósa-Seymour conjecture.'' Journal of Graph Theory, 29, 1998, pp. 167-176 (with János Komlós, Endre Szemerédi). (
Proof of the Seymour conjecture for large graphs.'' Annals of Combinatorics, 1, 1998, pp. 43-60 (with János Komlós, Endre Szemerédi).
Complete tripartite subgraphs in the coprime graph of integers.'' Discrete Mathematics, 202, 1999, pp. 227-238.
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).
Professional Highlights & Honors
Good Teaching Award, 1995
University of Pennsylvania
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences, 2009