Instituto de Matemática e Estatística USP - University of São Paulo, Brazil
Kohayakawa (PhD, Cambridge, 1991) is a Full Professor at the Institute of Mathematics and Statistics of the University of São Paulo. He works mainly in the areas of discrete mathematics and theoretical computer science. He was one of the first researchers to promote the use of Szemerédi's regularity method in the sparse setting, focusing on analogues of classical extremal problems in sparse random environments. More recently, he investigated limits of permutation sequences and successfully obtained strong estimates on the number of B_h-sets. His papers on chromatic thresholds of graphs, co-authored with P. Allen, J. Böttcher, S. Griffiths, and R. Morris, received the 2018 Delbert Ray Fulkerson Prize of the American Mathematical Society and Mathematical Optimization Society. He is a member of the Academy of Sciences of the State of São Paulo and of the Brazilian Academy of Sciences.
Sustainable Development Goals:
4 - Quality education
Graphs; hypergraphs; random graphs; extremal problems; Ramsey theory; Szemerédi's regularity method; pseudorandomness; testing.
Place of Birth:
Country of birth:
Date of birth