Yoshiharu Kohayakawa

Yoshiharu Kohayakawa (Japanese: 小早川美晴; born 1963) is a Japanese-Brazilian mathematician working on discrete mathematics and probability theory.[1] He is known for his work on Szemerédi's regularity lemma, which he extended to sparser graphs.[2][3]

Yoshiharu Kohayakawa, in 2017.

Biography

Kohayakawa was a student of Béla Bollobás at the University of Cambridge.[4]

According to Google Scholar, as of August 21, 2019, Kohayakawa's works have been cited over 3194 times, and his h-index is 33.[5]

He is a titular member of the Brazilian Academy of Sciences.[1]

In 2000, five American researchers received an USA NSF Research Grant in the value of $20,000 to go to Brazil to work in collaboration with him on mathematical problems.[6]

Kohayakawa has an Erdős number of 1.[7][8]

He was awarded the 2018 Fulkerson Prize.

gollark: Did you know? `curl | sh` bad.
gollark: ++delete <@!151149148639330304> (outdated nodejs)
gollark: You're not on node 14 like me?!
gollark: JS contains ████ known apiohazards and there *may* be up to ██████ more.
gollark: ... or that.

References
  1. Brazilian Academy of Sciences – Yoshiharu Kohayakawa Archived May 24, 2015, at the Wayback Machine
  2. László Lovász – Large Networks and Graph Limits, p. 395
  3. Bridget S. Webb – Surveys in Combinatorics 2005, p. 227
  4. Mathematics Genealogy Project – Yoshiharu Kohayakawa
  5. Google Scholar Profile – Yoshiharu Kohayakawa
  6. U.S.-Brazil Cooperative Research: Problems on Random Graphs (Structures) and Set Systems: NSG GRANT 0072064
  7. Celina Miraglia Herrera – My Erdős number
  8. He wrote "The size of the largest bipartite subgraphs", on Discrete Mathematics with Erdős and Gyárfás
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.