30 citations · 73 across the 19 of their papers we have counts for
4 papers · 1 filter
The Bandwidth Theorem in Sparse Graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller +1
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any -vertex graph with minimum degree contains all -vert…
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…
Ramsey numbers for bipartite graphs with small bandwidth
Guilherme O. Mota, Gábor N. Sárközy, Mathias Schacht +1
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers fo…