What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (97.95%)
- Discrete mathematics (57.95%)
- Graph (30.26%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (97.95%)
- Graph (30.26%)
- Random graph (25.64%)
In recent papers he was focusing on the following fields of study:
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.
Between 2017 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
