Gábor N. Sárközy is a Hungarian

Hungary

Hungary , officially the Republic of Hungary , is a landlocked country in Central Europe. It is situated in the Carpathian Basin and is bordered by Slovakia to the north, Ukraine and Romania to the east, Serbia and Croatia to the south, Slovenia to the southwest and Austria to the west. The...

-American Mathematician. Sárközy is a professor in the Computer Science Department at Worcester Polytechnic Institute

Worcester Polytechnic Institute

Worcester Polytechnic Institute is a private university located in Worcester, Massachusetts, in the United States.Founded in 1865 in Worcester, WPI was one of the United States' first engineering and technology universities...

, MA, United States and also a research fellow at the Computer and Automation Research Institute in the Hungarian Academy of Sciences

Hungarian Academy of Sciences

The Hungarian Academy of Sciences is the most important and prestigious learned society of Hungary. Its seat is at the bank of the Danube in Budapest.-History:...

 . He holds a Diploma from Eötvös Loránd University and a PhD from Rutgers

Rutgers University

Rutgers, The State University of New Jersey , is the largest institution for higher education in New Jersey, United States. It was originally chartered as Queen's College in 1766. It is the eighth-oldest college in the United States and one of the nine Colonial colleges founded before the American...

, both in Computer Science

Computer science

Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...

. His doctoral adviser was Endre Szemerédi

Endre Szemerédi

Endre Szemerédi is a Hungarian mathematician, working in the field of combinatorics and theoretical computer science. He is the State of New Jersey Professor of computer science at Rutgers University since 1986...

 . Sarkozy is most well known for his work on extensions to the Szemerédi regularity lemma

Szemerédi regularity lemma

In mathematics, the Szemerédi regularity lemma states that every large enough graph can be divided into subsets of about the same size so that the edges between different subsets behave almost randomly. introduced a weaker version of this lemma, restricted to bipartite graphs, in order to prove ...

.

He has an Erdős number

Erdos number

The Erdős number describes the "collaborative distance" between a person and mathematician Paul Erdős, as measured by authorship of mathematical papers.The same principle has been proposed for other eminent persons in other fields.- Overview :...

of 1 .