27 citations · 137 across the 40 of their papers we have counts for
6 papers · 1 filter
Blow-up lemmas for sparse graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. Thi…
Monochromatic trees in random graphs
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
Bal and DeBiasio [Partitioning random graphs into monochromatic components, Electron. J. Combin. 24 (2017), Paper 1.18] put forward a conjecture concerning the threshold for the fo…
Counting results for sparse pseudorandom hypergraphs II
Yoshiharu Kohayakawa, Guilherme O. Mota, Mathias Schacht +1
We present a variant of a universality result of Rödl [On universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986), no. 1-2, 125-134] for sparse, -unifo…
Counting results for sparse pseudorandom hypergraphs I
Yoshiharu Kohayakawa, Guilherme O. Mota, Mathias Schacht +1
We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embeddi…
Upper bounds on probability thresholds for asymmetric Ramsey properties
Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel
Given two graphs and , we investigate for which functions the random graph (the binomial random graph on vertices with edge probability ) satisfies…
Discrepancy and Eigenvalues of Cayley Graphs
Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht
We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue g…