Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

H-index: 40

Latin America-Brazil

About Yoshiharu Kohayakawa

Yoshiharu Kohayakawa, With an exceptional h-index of 40 and a recent h-index of 19 (since 2020), a distinguished researcher at Universidade de São Paulo, specializes in the field of Combinatorics, graph theory, probability, theoretical computer science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Resilience for loose Hamilton cycles

A canonical Ramsey theorem with list constraints in random graphs

The mod k k chromatic index of graphs is O (k) O(k)

Guest editorial: special issue on theoretical informatics

The anti-Ramsey threshold of complete graphs

Opening Note: The Golden Jubilee of the Institute of Mathematics and Statistics of the University of São Paulo

Factors in randomly perturbed hypergraphs

Directed graphs with lower orientation Ramsey thresholds

Yoshiharu Kohayakawa Information

University

Position

Instituto de Matemática e Estatística Brazil

Citations(all)

4477

Citations(since 2020)

1440

Cited By

3721

hIndex(all)

40

hIndex(since 2020)

19

i10Index(all)

93

i10Index(since 2020)

50

Email

University Profile Page

Universidade de São Paulo

Google Scholar

View Google Scholar Profile

Yoshiharu Kohayakawa Skills & Research Interests

Combinatorics

graph theory

probability

theoretical computer science

Top articles of Yoshiharu Kohayakawa

Title

Journal

Author(s)

Publication Date

Resilience for loose Hamilton cycles

Procedia Computer Science

José D Alvarado

Yoshiharu Kohayakawa

Richard Lang

Guilherme Oliveira Mota

Henrique Stagni

2023/1/1

A canonical Ramsey theorem with list constraints in random graphs

Procedia Computer Science

José D Alvarado

Yoshiharu Kohayakawa

Patrick Morris

Guilherme Oliveira Mota

2023/1/1

The mod k k chromatic index of graphs is O (k) O(k)

Journal of Graph Theory

Fábio Botler

Lucas Colucci

Yoshiharu Kohayakawa

2023/1

Guest editorial: special issue on theoretical informatics

Algorithmica

Yoshiharu Kohayakawa

Flávio K Miyazawa

2023/8

The anti-Ramsey threshold of complete graphs

Discrete Mathematics

Yoshiharu Kohayakawa

Guilherme Oliveira Mota

Olaf Parczyk

Jakob Schnitzer

2023/5/1

Opening Note: The Golden Jubilee of the Institute of Mathematics and Statistics of the University of São Paulo

São Paulo Journal of Mathematical Sciences

Junior Barrera

Luiz Renato Fontes

Claudio Gorodski

Clodoaldo Grotta Ragazzo

Yoshiharu Kohayakawa

2022/5

Factors in randomly perturbed hypergraphs

Random Structures & Algorithms

Yulin Chang

Jie Han

Yoshiharu Kohayakawa

Patrick Morris

Guilherme Oliveira Mota

2022/3

Directed graphs with lower orientation Ramsey thresholds

arXiv e-prints

Gabriel Ferreira Barros

Bruno Pasqualotto Cavalar

Yoshiharu Kohayakawa

Guilherme Oliveira Mota

Tássio Naia

2022/11

The threshold for the constrained Ramsey property

arXiv preprint arXiv:2207.05201

Maurício Collares

Yoshiharu Kohayakawa

Carlos Gustavo Moreira

Guilherme Oliveira Mota

2022/7/11

The mod k chromatic index of random graphs

Fábio Botler

Lucas Colucci

Yoshiharu Kohayakawa

2022/7

Near-perfect clique-factors in sparse pseudorandom graphs

Combinatorics, Probability and Computing

Jie Han

Yoshiharu Kohayakawa

Yury Person

2021/7

Orientation Ramsey thresholds for cycles and cliques

SIAM Journal on Discrete Mathematics

Gabriel Ferreira Barros

Bruno Pasqualotto Cavalar

Yoshiharu Kohayakawa

Tássio Naia

2021

The size‐Ramsey number of powers of bounded degree trees

Journal of the London Mathematical Society

Sören Berger

Yoshiharu Kohayakawa

Giulia Satiko Maesaka

Taísa Martins

Walner Mendonça

...

2021/6

Covering 3-edge-colored random graphs with monochromatic trees

SIAM Journal on Discrete Mathematics

Yoshiharu Kohayakawa

Walner Mendonça

Guilherme Oliveira Mota

Bjarne Schülke

2021

Hitting times for arc-disjoint arborescences in random digraph processes

Procedia Computer Science

Maurício Collares

Yoshiharu Kohayakawa

Táısa Martins

Roberto Parente

Victor Souza

2021/1/1

On strong Sidon sets of integers

Journal of Combinatorial Theory, Series A

Yoshiharu Kohayakawa

Sang June Lee

Carlos Gustavo Moreira

Vojtěch Rödl

2021/10/1

On the query complexity of estimating the distance to hereditary graph properties

SIAM Journal on Discrete Mathematics

Carlos Hoppen

Yoshiharu Kohayakawa

Richard Lang

Hanno Lefmann

Henrique Stagni

2021

A tight lower bound for the online bounded space hypercube bin packing problem

Discrete Mathematics & Theoretical Computer Science

Yoshiharu Kohayakawa

Flávio Keidi Miyazawa

Yoshiko Wakabayashi

2021/9/14

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Journal of Graph Theory

Jie Han

Yoshiharu Kohayakawa

Patrick Morris

Yury Person

2021/1

Constrained colourings of random graphs

Procedia Computer Science

Maurício Collares

Yoshiharu Kohayakawa

Carlos Gustavo Moreira

Guilherme Oliveira Mota

2021/1/1

See List of Professors in Yoshiharu Kohayakawa University(Universidade de São Paulo)