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 has a PhD advised by Béla Bollobás at the University of Cambridge with the dissertation External Combinatorics and the Evolution of Random Graphs.[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]
Kohayakawa has an Erdős number of 1.[6][7]
He was awarded the 2018 Fulkerson Prize.[8]
References
- "Yoshiharu Kohayakawa – ABC – Academia Brasileira de Ciências". www.abc.org.br. Retrieved 2025-07-07.
- 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
- "Celina Herrera de Figueiredo: My Erdös number". www.cos.ufrj.br. Retrieved 2025-07-07.
- Erdős, Paul; Gyárfás, András; Kohayakawa, Yoshiharu (1997-12-01). "The size of the largest bipartite subgraphs". Discrete Mathematics. 177 (1): 267–271. doi:10.1016/S0012-365X(97)00004-6. ISSN 0012-365X.
- FAPESP. "Yoshiharu Kohayakawa, professor no IME-USP, ganha prêmio internacional em matemática". AGÊNCIA FAPESP (in Brazilian Portuguese). Retrieved 2025-07-07.