- Home
- Best Scientists - Mathematics
- Yoshiharu Kohayakawa

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
35
Citations
3,620
136
World Ranking
5897
National Ranking
20

Mathematics
D-index
35
Citations
3,604
132
World Ranking
1426
National Ranking
12

2019 - Fellow, The World Academy of Sciences

- Combinatorics
- Discrete mathematics
- Algebra

Yoshiharu Kohayakawa mostly deals with Combinatorics, Discrete mathematics, Random graph, Graph and Lemma. His Combinatorics study frequently draws parallels with other fields, such as Pseudorandom number generator. His Discrete mathematics study combines topics in areas such as Almost surely, Embedding and Range.

His study in Almost surely is interdisciplinary in nature, drawing from both Function, Number theory and Constant. He frequently studies issues relating to Bipartite graph and Random graph. Yoshiharu Kohayakawa has included themes like Bounded function and Dense graph in his Lemma study.

- Szemerédi's regularity lemma for sparse graphs (110 citations)
- Arithmetic progressions of length three in subsets of a random set (93 citations)
- Hypergraphs, Quasi-randomness, and Conditions for Regularity (81 citations)

Yoshiharu Kohayakawa spends much of his time researching Combinatorics, Discrete mathematics, Graph, Random graph and Bounded function. His work carried out in the field of Combinatorics brings together such families of science as Upper and lower bounds and Pseudorandom number generator. His Discrete mathematics research focuses on Random regular graph, Indifference graph, Chordal graph, Lemma and Hypergraph.

His work in the fields of Graph, such as Ramsey's theorem, intersects with other areas such as Monochromatic color. His studies deal with areas such as Time complexity, Binomial, Vertex, Almost surely and Extremal graph theory as well as Random graph. His research integrates issues of Vertex and Absolute constant in his study of Conjecture.

- Combinatorics (97.95%)
- Discrete mathematics (57.95%)
- Graph (30.26%)

- Combinatorics (97.95%)
- Graph (30.26%)
- Random graph (25.64%)

His primary areas of study are Combinatorics, Graph, Random graph, Ramsey's theorem and Bounded function. His Combinatorics study combines topics from a wide range of disciplines, such as Discrete mathematics and Pseudorandom number generator. The concepts of his Discrete mathematics study are interwoven with issues in Range and Almost surely.

His Random graph research includes elements of Strongly connected component and Binomial. His study looks at the relationship between Ramsey's theorem and topics such as Integer, which overlap with Treewidth, Corollary and Existential quantification. His research in Bounded function intersects with topics in Bin, Bin packing problem, Hypercube and Sequence.

- Universality for bounded degree spanning trees in randomly perturbed graphs (21 citations)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (19 citations)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (11 citations)

- Combinatorics
- Discrete mathematics
- Algebra

His primary areas of investigation include Combinatorics, High probability, Random graph, Ramsey's theorem and Graph. In his works, Yoshiharu Kohayakawa performs multidisciplinary study on Combinatorics and Monochromatic color. Random graph and Partition are frequently intertwined in his study.

The subject of his Ramsey's theorem research is within the realm of Discrete mathematics. His Hamiltonian path research integrates issues from Vertex and Binomial. His Degree study frequently draws connections between adjacent fields such as Bounded function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Szemerédi's regularity lemma for sparse graphs

Y. Kohayakawa.

FoCM '97 Selected papers of a conference on Foundations of computational mathematics **(1997)**

166 Citations

On K 4 -Free Subgraphs of Random Graphs.

Y. Kohayakawa;T. Łuczak;V. Rödl.

Combinatorica **(1997)**

138 Citations

Limits of permutation sequences

Carlos Hoppen;Yoshiharu Kohayakawa;Carlos Gustavo Moreira;BaláZs RáTh.

Journal of Combinatorial Theory, Series B **(2013)**

117 Citations

Arithmetic progressions of length three in subsets of a random set

Yoshiharu Kohayakawa;Tomasz Łuczak;Vojtěch Rödl.

Acta Arithmetica **(1996)**

113 Citations

Szemerédi’s Regularity Lemma and Quasi-randomness

Y. Kohayakawa;V. Rödl.

**(2003)**

108 Citations

The Induced Size-Ramsey Number of Cycles

P. E. Haxell;Y. Kohayakawa;T. Łuczak.

Combinatorics, Probability & Computing **(1995)**

92 Citations

Hypergraphs, Quasi-randomness, and Conditions for Regularity

Yoshiharu Kohayakawa;Vojtěch Rödl;Jozef Skokan.

Journal of Combinatorial Theory, Series A **(2002)**

90 Citations

Measures of pseudorandomness for finite sequences: typical values

Noga Alon;Yoshiharu Kohayakawa;Christian Mauduit;Carlos Gustavo T. de Moreira.

Proceedings of The London Mathematical Society **(2007)**

81 Citations

Weak hypergraph regularity and linear hypergraphs

Yoshiharu Kohayakawa;Brendan Nagle;Vojtěch Rödl;Mathias Schacht.

Journal of Combinatorial Theory, Series B **(2010)**

75 Citations

Tura´n's extremal problem in random graphs: forbidding even cycles

P. E. Haxell;Y. Kohayakawa;T. Łuczak.

Journal of Combinatorial Theory, Series B **(1995)**

74 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Emory University

University of Memphis

Adam Mickiewicz University in Poznań

Adam Mickiewicz University in Poznań

Tel Aviv University

Alfréd Rényi Institute of Mathematics

ETH Zurich

Google (United States)

Hungarian Academy of Sciences

Universidade Federal de Minas Gerais

Something went wrong. Please try again later.