Yoshiharu Kohayakawa

Yoshiharu Kohayakawa's AcademicInfluence.com Rankings

Computer Science

#4019

World Rank

#4226

Historical Rank

Database

#8676

World Rank

#9100

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Yoshiharu Kohayakawa Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Yoshiharu Kohayakawa is a Japanese-Brazilian mathematician working on discrete mathematics and probability theory. He is known for his work on Szemerédi's regularity lemma, which he extended to sparser graphss.

(See a Problem?)

Yoshiharu Kohayakawa's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Szemerédi's regularity lemma for sparse graphs (1997) (176)
Arithmetic progressions of length three in subsets of a random set (1996) (98)
Szemerédi’s Regularity Lemma and Quasi-randomness (2003) (98)
Hypergraphs, Quasi-randomness, and Conditions for Regularity (2002) (91)
The Induced Size-Ramsey Number of Cycles (1995) (86)
Weak hypergraph regularity and linear hypergraphs (2010) (77)
The Evaluation of Random Subgraphs of the Cube (1992) (71)
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles (1995) (69)
Measures of pseudorandomness for finite sequences: typical values (2007) (68)
OnK4-free subgraphs of random graphs (1997) (63)
The 3-colored Ramsey number of odd cycles (2005) (60)
Regular pairs in sparse random graphs I (2003) (60)
Ramsey Games Against a One-Armed Bandit (2003) (58)
The hypergraph regularity method and its applications. (2005) (57)
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth (1998) (55)
Finding Skew Partitions Efficiently (2000) (54)
Turán's extremal problem in random graphs: Forbidding odd cycles (1996) (53)
Threshold functions for asymmetric Ramsey properties involving cycles (1997) (52)
Small subsets inherit sparse ε-regularity (2004) (50)
Sparse partition universal graphs for graphs of bounded degree (2011) (50)
An Optimal Algorithm for Checking Regularity (2003) (47)
Universality and tolerance (2000) (46)
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal (2009) (46)
Invariant measures for a two-species asymmetric process (1994) (45)
The size-Ramsey number of trees (1995) (45)
Universality for bounded degree spanning trees in randomly perturbed graphs (2018) (45)
Blow-up lemmas for sparse graphs (2016) (44)
The Turán Theorem for Random Graphs (2004) (43)
On the Resilience of Long Cycles in Random Graphs (2008) (40)
Searching in random partially ordered sets (2002) (39)
A Practical Minimal Perfect Hashing Method (2005) (39)
Properly coloured copies and rainbow copies of large graphs with small maximum degree (2010) (38)
The chromatic thresholds of graphs (2011) (38)
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (2015) (37)
The size of the largest bipartite subgraphs (1997) (37)
Multidimensional Cube Packing (2001) (37)
Induced Ramsey Numbers (1998) (37)
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family (2015) (35)
Partitioning by Monochromatic Trees (1996) (35)
Powers of tight Hamilton cycles in randomly perturbed hypergraphs (2018) (31)
Measures of Pseudorandomness for Finite Sequences: Minimal Values (2006) (30)
Near-optimum Universal Graphs for Graphs with Bounded Degrees (2001) (29)
An improved upper bound on the density of universal random graphs (2012) (29)
Hereditary Properties of Triple Systems (2003) (29)
Testing permutation properties through subpermutations (2011) (29)
The spectral gap of the REM under Metropolis dynamics (1998) (29)
Packing and Covering Triangles in Tripartite Graphs (1998) (28)
Limits of permutation sequences through permutation regularity (2011) (27)
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (2014) (26)
Efficient Testing of Hypergraphs (2002) (26)
Small subsets inherit sparse epsilon-regularity (2007) (24)
Hypergraphs with many Kneser colorings (2012) (23)
The size‐Ramsey number of powers of paths (2017) (23)
Percolation in High Dimensions (1994) (22)
MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES (2003) (22)
Tight Hamilton cycles in random hypergraphs (2013) (21)
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size (2012) (21)
Universality of random graphs (2008) (20)
The multicolour size-Ramsey number of powers of paths (2018) (18)
Powers of Hamilton cycles in pseudorandom graphs (2014) (18)
On an anti-Ramsey threshold for random graphs (2014) (18)
Upper bounds on probability thresholds for asymmetric Ramsey properties (2014) (18)
An extension of the Erdős-Stone theorem (1994) (17)
On Richardsons model on the hypercube (1997) (17)
Embedding graphs with bounded degree in sparse pseudorandom graphs (2004) (16)
An Extension of the Blow-up Lemma to Arrangeable Graphs (2013) (15)
Turán's theorem for pseudo-random graphs (2007) (15)
On an anti‐Ramsey threshold for sparse graphs with one triangle (2018) (15)
Ramsey Properties of Orientations of Graphs (1993) (15)
A note on the Size-Ramsey number of long subdivisions of graphs (2005) (15)
The size‐Ramsey number of powers of bounded degree trees (2019) (14)
Distance Graphs on the Integers (2005) (14)
On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs (2010) (14)
Monochromatic trees in random graphs (2016) (13)
On the Diameter and Radius of Random Subgraphs of the Cube (1994) (13)
The size Ramsey number of short subdivisions of bounded degree graphs (2018) (12)
On the Anti-Ramsey Property of Ramanujan Graphs (1995) (10)
Connectivity Properties of Random Subgraphs of the Cube (1995) (10)
The length of random subsets of Boolean lattices (2000) (10)
An algorithmic Friedman{Pippenger theorem on tree embeddings and applications (2008) (10)
Efficient testing of hypergraphs: (Extended abstract) (2002) (10)
Discrepancy and eigenvalues of Cayley graphs (2016) (9)
Querying priced information in databases: The conjunctive case (2004) (9)
Special Issue on Ramsey Theory (2003) (9)
The maximum size of a Sidon set contained in a sparse random set of integers (2011) (9)
The anti-Ramsey threshold of complete graphs (2019) (9)
Densities in large permutations and parameter testing (2014) (9)
The number of Bh ‐sets of a given cardinality (2018) (8)
On the Number of Bh-Sets (2015) (8)
Near-perfect clique-factors in sparse pseudorandom graphs (2018) (7)
Ramsey minimal graphs (2001) (7)
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length (2014) (7)
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (2015) (7)
Algorithmic Aspects of Regularity (2000) (7)
A note on supersaturated set systems (2016) (7)
The Regularity Lemma of Szemerédi for Sparse Graphs (1993) (7)
Chromatic thresholds in dense random graphs (2015) (7)
Infinite Sidon Sets Contained in Sparse Random Sets of Integers (2018) (7)
An optimal algorithm for checking regularity: (extended abstract) (2002) (6)
Clique-factors in sparse pseudorandom graphs (2018) (6)
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (2011) (6)
An Unstable Hypergraph Problem with a Unique Optimal Solution (2013) (6)
Property testing and parameter testing for permutations (2010) (6)
Kneser Colorings of Uniform Hypergraphs (2009) (6)
The Width of Random Subsets of Boolean Lattices (2002) (6)
The number of B3-sets of a given cardinality (2016) (5)
The size-Ramsey number of 3-uniform tight paths (2019) (5)
Factors in randomly perturbed hypergraphs (2020) (5)
A note on permutation regularity (2009) (5)
Triangle-Free Subgraphs of Random Graphs (2015) (5)
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness (2008) (4)
Estimating the distance to a hereditary graph property (2017) (4)
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing (2006) (4)
On an anti-Ramsey property of random graphs (2011) (4)
A note on long-range percolation (1992) (4)
Ramsey-type results for oriented trees (1996) (4)
Chromatic thresholds in sparse random graphs (2015) (4)
Essentially infinite colourings of hypergraphs (2007) (4)
Estimating parameters associated with monotone properties (2017) (4)
Counting restricted orientations of random graphs (2018) (4)
Every hereditary permutation property is testable (2011) (3)
Making spanning graphs (2017) (3)
On strong Sidon sets of integers (2021) (3)
Sparse Anti-Ramsey Graphs (1995) (3)
A note on induced cycles in Kneser graphs (1991) (3)
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2017) (3)
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall (2002) (3)
Finding any given 2‐factor in sparse pseudorandom graphs efficiently (2019) (3)
A Note on Kernels of Intersecting Families (1990) (3)
Large permutations and parameter testing (2014) (3)
The mod $k$ chromatic index of graphs is $O(k)$ (2020) (3)
On hypergraphs without loose cycles (2017) (3)
Counting results for sparse pseudorandom hypergraphs I (2016) (3)
Estimating Parameters Associated with Monotone Properties. (2016) (3)
Counting results for sparse pseudorandom hypergraphs II (2016) (3)
Extremal and probabilistic results for order types (2019) (2)
THE SIZE-RAMSEY NUMBER (1995) (2)
Essentially Infinite Colourings of Graphs (2000) (2)
Hypergraphs with many Kneser colorings (Extended Version) (2011) (2)
Orientation Ramsey Thresholds for Cycles and Cliques (2020) (2)
On small graphs with highly imperfect powers (1992) (2)
An approximate blow-up lemma for sparse pseudorandom graphs (2013) (2)
Powers of Hamilton cycles in pseudorandom graphs (2016) (2)
Bounds for optimal coverings (2001) (1)
An Extension of the Erds-Stone Theorem (1994) (1)
On some extremal results for order types (2019) (1)
Oriented Graphs with Lower Orientation Ramsey Thresholds (2021) (1)
On the query complexity of estimating the distance to hereditary graph properties (2019) (1)
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (2020) (1)
Constrained colourings of random graphs (2021) (1)
Equivalent conditions for regularity (2000) (1)
Property Testing for Point Sets on the Plane (2018) (1)
The mod k $k$ chromatic index of graphs is O(k) $O(k)$ (2022) (1)
A perspective on theoretical computer science in Latin America (2020) (1)
Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile (2006) (1)
1 1 A ug 2 01 6 CHROMATIC THRESHOLDS IN DENSE RANDOM GRAPHS (2018) (1)
A note on counting orientations (2011) (1)
The odd chromatic index of almost all graphs (2020) (1)
Multidimensional Cube Packing 1 (0)
A counting lemma for sparse pseudorandom hypergraphs (2015) (0)
The chromatic threshold of graphs (2013) (0)
A tight lower bound for the online bounded space hypercube bin packing problem (2021) (0)
Equivalent Conditions for Regularity (Extended Abstract) (2000) (0)
1 1 A ug 2 01 6 CHROMATIC THRESHOLDS IN SPARSE RANDOM GRAPHS (0)
A canonical Ramsey theorem with list constraints in random graphs (2023) (0)
Discrepancy and Eigenvalues of Cayley Graphs ( extended abstract ) (2006) (0)
Fourth IFIP International Conference on Theoretical Computer Science - TCS 2006: IFIP 19th World Computer Congress, TC-1, Foundations of Computer Science, ... Federation for Information Processing) (2006) (0)
Guest Editorial: Special Issue on Theoretical Informatics (2023) (0)
Opening Note: The Golden Jubilee of the Institute of Mathematics and Statistics of the University of São Paulo (2022) (0)
On the number of r-transitive orientations of G(n, p) (2017) (0)
AN ALGORITHMIC FRIEDMAN–PIPPENGER THEOREM ON TREE EMBEDDINGS (PRELIMINARY VERSION) (2004) (0)
The Mod k Chromatic Index of Random Graphs (2022) (0)
Bounds for Optimal CoveringsCarlos (2002) (0)
Sear hing in Random Partially Ordered Sets ( Extended Abstra t ) (2007) (0)
Covering 3-coloured random graphs with monochromatic trees (2019) (0)
EDGE COLORINGS OF GRAPHS AVOIDING PRESCRIBED COLORED MATCHINGS OF FIXED SIZE (2013) (0)
Sunflower Theorems in Monotone Circuit Complexity (2021) (0)
The threshold for the constrained Ramsey property (2022) (0)
Ju l 2 02 1 A TIGHT LOWER BOUND FOR THE ONLINE BOUNDED SPACE HYPERCUBE BIN PACKING PROBLEM (2021) (0)
Preface (2019) (0)
Random Graphs III (2006) (0)
Triangle-free subgraphs of random graphs Article (Accepted (2017) (0)
Finding Skew Partitions Efficiently 1 (2000) (0)
ON SUPERSATURATED SET SYSTEMS 1 (2014) (0)
Hitting times for arc-disjoint arborescences in random digraph processes (2021) (0)
Discrepancy and eigenvalues of Cayley graphs (2016) (0)
Advances in the Regularity Method (2004) (0)
Directed graphs with lower orientation Ramsey thresholds (2022) (0)
On Cameron{Erd}os problem of Sidon sets (2013) (0)
LATIN 2020: Theoretical Informatics: 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings (2020) (0)
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium (2022) (0)
A note on random k-dimensional posets (2011) (0)

This paper list is powered by the following services:

Other Resources About Yoshiharu Kohayakawa

en.wikipedia.org

What Schools Are Affiliated With Yoshiharu Kohayakawa?

Yoshiharu Kohayakawa is affiliated with the following schools:

Yoshiharu Kohayakawa's Academic­Influence.com Rankings