Yoshiharu Kohayakawa
Computational Theory and Mathematics · 2003–2015
A researcher in the Science corpus: 5 papers; trusts 5 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 14 citations into it; #7,186 of 12,182 by trust here, #6,798 by citations
- Discrete Mathematics and Combinatorics — 8 citations into it; #1,151 of 2,017 by trust here, #812 by citations
- Geometry and Topology — 6 citations into it; #3,468 of 7,422 by trust here, #4,201 by citations
Whom Yoshiharu Kohayakawa trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vojtech Rödl
- William T. Gowers
- Béla Bollobás
- Jozef Skokan
- Svante Janson
- Alan M. Frieze
- Alexei Stepanov
- Jirí Matousek
Who trusts Yoshiharu Kohayakawa overall
Papers from Yoshiharu Kohayakawa's perspective
Ordered by how strongly the researchers Yoshiharu Kohayakawa trusts endorse each paper. Same corpus, a different order for every researcher.
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Generalization of the Borel-Cantelli Lemma
- Combinatorial theorems in sparse random sets
- Regularity Lemmas for Graphs
- Szemerédi’s Lemma for the Analyst
- Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
- Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
- Using The Borsuk-Ulam Theorem
- On the Density of Families of Sets
- Shadows and intersections: Stability and new proofs
Their papers
- Szemerédi’s Regularity Lemma and Quasi-randomness (2003) — 98 citations
- The chromatic thresholds of graphs (2011) — 48 citations
- Sparse partition universal graphs for graphs of bounded degree (2011) — 58 citations
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family (2015) — 56 citations
- Measures of pseudorandomness for finite sequences: typical values (2007) — 77 citations