2019 - Fellow, The World Academy of Sciences
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.
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.
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.
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
FoCM '97 Selected papers of a conference on Foundations of computational mathematics (1997)
On K 4 -Free Subgraphs of Random Graphs.
Y. Kohayakawa;T. Łuczak;V. Rödl.
Limits of permutation sequences
Carlos Hoppen;Yoshiharu Kohayakawa;Carlos Gustavo Moreira;BaláZs RáTh.
Journal of Combinatorial Theory, Series B (2013)
Arithmetic progressions of length three in subsets of a random set
Yoshiharu Kohayakawa;Tomasz Łuczak;Vojtěch Rödl.
Acta Arithmetica (1996)
Szemerédi’s Regularity Lemma and Quasi-randomness
Y. Kohayakawa;V. Rödl.
The Induced Size-Ramsey Number of Cycles
P. E. Haxell;Y. Kohayakawa;T. Łuczak.
Combinatorics, Probability & Computing (1995)
Hypergraphs, Quasi-randomness, and Conditions for Regularity
Yoshiharu Kohayakawa;Vojtěch Rödl;Jozef Skokan.
Journal of Combinatorial Theory, Series A (2002)
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)
Weak hypergraph regularity and linear hypergraphs
Yoshiharu Kohayakawa;Brendan Nagle;Vojtěch Rödl;Mathias Schacht.
Journal of Combinatorial Theory, Series B (2010)
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)
If you think any of the details on this page are incorrect, let us know.
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: