OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Gábor N. Sárközy

 Home Mathematics Fields of mathematics Applied mathematics Theoretical computer science Theoretical computer scientists
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Gábor N. Sárközy is a Hungarian mathematician known for his work in combinatorics, particularly in the areas of graph theory and additive combinatorics. He has made significant contributions to research in various mathematical topics, including extremal combinatorics, number theory, and the theory of random graphs. Sárközy has published numerous academic papers and collaborated with other mathematicians in these fields.

 Ancestors (6)

  1. Theoretical computer scientists
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook