Fuller Labs 134
+1 (508) 8315408
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.

Fuller Labs 134
+1 (508) 8315408

Scholarly Work

Cycles in bipartite graphs and an application in Number Theory.'' Journal of Graph Theory, 19 (3), 1995, pp. 323-331.
Proof of the Seymour conjecture for large graphs.'' Annals of Combinatorics, 1, 1998, pp. 43-60 (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).
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.'' Journal of Graph Theory 59, 2008, pp. 34-44 (with Paul Dorbec and Sylvain Gravier).
Gallai colorings of non-complete graphs.'' Discrete Mathematics 310, 2010, pp. 977-980 (with András Gyárfás).
Professional Highlights & Honors
William Smith Dean’s Professor
Rutgers University
Good Teaching Award
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences
Board Member

Students should work with their individual airlines to cancel tickets and pursue refunds or credits for their airfare. The university can provide a letter to the airline summarizing our decision to cancel programs given the advice from the U.S. Centers for Disease Control & Prevention and Massachusetts Governor’s Office; this may help those seeking refunds or credits for flights. Contact IGSD at 508-831-5547 for a letter. 

Start Expanded