Yoshiharu Kohayakawa
Japanese-Brazilian mathematician
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]
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 a 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.
References
- ^ a b Brazilian Academy of Sciences – Yoshiharu Kohayakawa Archived May 24, 2015, at the Wayback Machine
- ^ 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
- ^ Celina Miraglia Herrera – My Erdős number
- ^ He wrote "The size of the largest bipartite subgraphs", on Discrete Mathematics with Erdős and Gyárfás
External links
- Home Page of Yoshiharu Kohayakawa at the University of São Paulo
Authority control databases  | |
|---|---|
| International |
|
| National |
|
| Academics |
|
