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: Go download JavaScript.
gollark: They're gollark instances η-17 to η-23.
gollark: Imagine how things would have turned out if they'd gone for Scheme after all.
gollark: > 1995 - At a neighborhood Italian restaurant Rasmus Lerdorf realizes that his plate of spaghetti is an excellent model for understanding the World Wide Web and that web applications should mimic their medium. On the back of his napkin he designs Programmable Hyperlinked Pasta (PHP). PHP documentation remains on that napkin to this day.
gollark: http://james-iry.blogspot.com/2009/05/brief-incomplete-and-mostly-wrong.html

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.