Yoshiharu Kohayakawa
Yoshiharu Kohayakawa (Japanese name: コハヤカワヨシハル, 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]
He was a student of Béla Bollobás on the University of Cambridge.[4]
According to Google Scholar, as of 6 March 2016, Kohayakawa's works have been cited over 2330 times, and his h-index is 28.[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]
References
- ^ a b Brazilian Academy of Sciences – Yoshiharu Kohayakawa
- ^ László Lovász – Large Networks and Graph Limits, p. 395
- ^ Bridget S. Webb – Surveys in Combinatorics 2005, p. 227
- ^ Mathematics Genealogy Project – Yoshiharu Kohayakawa
- ^ Google Scholar Profile – Yoshiharu Kohayakawa
- ^ U.S.-Brazil Cooperative Research: Problems on Random Graphs (Structures) and Set Systems: NSG GRANT 0072064