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. He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences. He is member of the editorial board of the European Journal of Combinatorics. He also has an Erdős number of 1.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Gábor N. Sárközy (en)
- Gábor Sárközy (pt)
|
rdfs:comment
| - Gábor N. Sárközy é um matemático húngaro-estadunidense. Sárközy é professor do Departamento de Ciência da Computação do e membro pesquisador do Instituto de Pesquisas em Computação e Automação da Academia de Ciências da Hungria. Graduado pela Universidade Eötvös Loránd com doutorado na Universidade Rutgers, ambos em ciência da computação. Seu orientador foi Endre Szemerédi. Sarkozy é conhecido por seu trabalho sobre extensões do . É filho do matemático . Tem número de Erdős 1. (pt)
- 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. He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences. He is member of the editorial board of the European Journal of Combinatorics. He also has an Erdős number of 1. (en)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - 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. He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences. He obtained a Diploma in Mathematics from Eötvös Loránd University and a PhD in Computer Science from Rutgers, under the advisement of Endre Szemerédi. Perhaps his best known result is the , in which, together with János Komlós and Endre Szemerédi he proved that the regular pairs in Szemerédi regularity lemma 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. He is member of the editorial board of the European Journal of Combinatorics. He also has an Erdős number of 1. (en)
- Gábor N. Sárközy é um matemático húngaro-estadunidense. Sárközy é professor do Departamento de Ciência da Computação do e membro pesquisador do Instituto de Pesquisas em Computação e Automação da Academia de Ciências da Hungria. Graduado pela Universidade Eötvös Loránd com doutorado na Universidade Rutgers, ambos em ciência da computação. Seu orientador foi Endre Szemerédi. Sarkozy é conhecido por seu trabalho sobre extensões do . É filho do matemático . Tem número de Erdős 1. (pt)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is doctoral students
of | |
is doctoral student
of | |
is foaf:primaryTopic
of | |