Gábor N. Sárközy, also known as Gabor Sarkozy, is a Hungarian-American mathematician, the son of noted mathematician

András Sárközy András Sárközy (born in Budapest) is a Hungarian mathematician, working in analytic and combinatorial number theory, although his first works were in the fields of geometry and classical analysis. He has the largest number of papers co-autho ...

. He is currently on faculty of the Computer Science Department at

Worcester Polytechnic Institute The Worcester Polytechnic Institute (WPI) is a Private university, private research university in Worcester, Massachusetts, United States. Founded in 1865, WPI was one of the United States' first engineering and technology universities and now h ...

, MA, United States and is also a senior research fellow at the

Alfréd Rényi Institute of Mathematics The Alfréd Rényi Institute of Mathematics () is the research institute in mathematics of the Hungarian Academy of Sciences. It was created in 1950 by Alfréd Rényi, who directed it until his death. Since its creation, the institute has been th ...

of the

Hungarian Academy of Sciences The Hungarian Academy of Sciences ( , MTA) is Hungary’s foremost and most prestigious learned society. Its headquarters are located along the banks of the Danube in Budapest, between Széchenyi rakpart and Akadémia utca. The Academy's primar ...

. He obtained a diploma in mathematics from

Eötvös Loránd University Eötvös Loránd University (, ELTE, also known as ''University of Budapest'') is a Hungarian public research university based in Budapest. Founded in 1635, ELTE is one of the largest and most prestigious public higher education institutions in ...

and a PhD in computer science from

Rutgers Rutgers University ( ), officially Rutgers, The State University of New Jersey, is a public land-grant research university consisting of three campuses in New Jersey. Chartered in 1766, Rutgers was originally called Queen's College and was aff ...

, under the advisement of

Endre Szemerédi Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science a ...

. Perhaps his best known result is the Blow-Up Lemma, in which, together with János Komlós and

he proved that the regular pairs in

Szemerédi regularity lemma In extremal graph theory, Szemerédi’s regularity lemma states that a graph can be partitioned into a bounded number of parts so that the edges between parts are regular (in the sense defined below). The lemma shows that certain properties of r ...

behave like complete bipartite graphs under the correct conditions. The lemma allowed for deeper exploration into the nature of embeddings of large sparse graphs into dense graphs. A hypergraph variant was developed later by

Peter Keevash Peter Keevash (born 30 November 1978) is a British mathematician, working in combinatorics. He is a professor of mathematics at the University of Oxford and a Fellow of Mansfield College. Early years Keevash was born in Brighton, England, but ...

. He is member of the editorial board of the ''

European Journal of Combinatorics The ''European Journal of Combinatorics'' is an international peer-reviewed scientific journal that specializes in combinatorics. The journal primarily publishes papers dealing with mathematical structures within combinatorics and/or establishing ...

''. He also has an

Erdős number The Erdős number () describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual ...

of 1.On Cycles in the Coprime Graph of Integers
/ref>

References

Combinatorialists Theoretical computer scientists 20th-century Hungarian mathematicians 21st-century Hungarian mathematicians Living people Year of birth missing (living people) {{Europe-mathematician-stub