The following pages link to Yoshiharu Kohayakawa (Q285061):
Displayed 50 items.
- A note on the Size-Ramsey number of long subdivisions of graphs (Q4680735) (← links)
- Connectivity properties of random subgraphs of the cube (Q4697813) (← links)
- (Q4737228) (← links)
- (Q4780792) (← links)
- Hereditary Properties of Triple Systems (Q4802166) (← links)
- The Turn Theorem for Random Graphs (Q4813867) (← links)
- (Q4828944) (← links)
- On an anti‐Ramsey property of Ramanujan graphs (Q4845079) (← links)
- The Induced Size-Ramsey Number of Cycles (Q4862744) (← links)
- (Q4871133) (← links)
- (Q4879159) (← links)
- Arithmetic progressions of length three in subsets of a random set (Q4883030) (← links)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
- Estimating parameters associated with monotone properties (Q4993108) (← links)
- Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
- The size‐Ramsey number of powers of bounded degree trees (Q5006327) (← links)
- Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
- A tight lower bound for the online bounded space hypercube bin packing problem (Q5024670) (← links)
- Counting restricted orientations of random graphs (Q5128751) (← links)
- The size-Ramsey number of 3-uniform tight paths (Q5162869) (← links)
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (Q5175228) (← links)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- The size‐Ramsey number of powers of paths (Q5229536) (← links)
- Extremal and probabilistic results for order types (Q5236208) (← links)
- An Extension of the Blow-up Lemma to Arrangeable Graphs (Q5254090) (← links)
- On the Number of<i>B<sub>h</sub></i>-Sets (Q5364267) (← links)
- (Q5365034) (← links)
- The hypergraph regularity method and its applications (Q5385859) (← links)
- (Q5417607) (← links)
- Essentially infinite colourings of hypergraphs (Q5427831) (← links)
- Measures of pseudorandomness for finite sequences: typical values (Q5427833) (← links)
- Experimental and Efficient Algorithms (Q5710049) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
- A note on permutation regularity (Q5891091) (← links)
- LATIN 2004: Theoretical Informatics (Q5901621) (← links)
- A note on permutation regularity (Q5916098) (← links)
- The size-Ramsey number of trees (Q5916315) (← links)
- The mod k $k$ chromatic index of random graphs (Q6047962) (← links)
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
- Factors in randomly perturbed hypergraphs (Q6074679) (← links)
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$ (Q6093146) (← links)
- Blow-up lemmas for sparse graphs (Q6280403) (← links)
- Making spanning graphs (Q6293979) (← links)
- The anti-Ramsey threshold of complete graphs (Q6313423) (← links)
- Finding any given 2-factor in sparse pseudorandom graphs efficiently (Q6314156) (← links)
- The threshold for the constrained Ramsey property (Q6404661) (← links)
- Directed graphs with lower orientation Ramsey thresholds (Q6417107) (← links)