5 papers · 1 filter
Regularity method for hypergraphs with -cycle-free links
Ayush Basu, Christian Reiher, Vojtěch Rödl +1
We extend the hypergraph regularity method to sparse -uniform hypergraphs whose vertex links are -free. In other words, we consider hypergraphs that are $K_{1,2,2…
Canonical Ramsey theorem for graphs with clean intersections
Matías Azócar Carvajal, Ayush Basu, Christian Reiher +3
Extending earlier results of Nešetřil and Rödl [Selective graphs and hypergraphs, Ann. Discrete Math. 3 (1978), 181--189], we show that for every ordered graph there exist an o…
Unavoidable subgraphs in Ramsey graphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
We study subgraphs that appear in large Ramsey graphs for a given graph . The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that…
Relative Turán densities of ordered graphs
Christian Reiher, Vojtěch Rödl, Marcelo Sales +1
We introduce a modification of the Turán density of ordered graphs and investigate this graph parameter.
Ramsey-type problems for generalised Sidon sets
Christian Reiher, Vojtěch Rödl, Mathias Schacht
We establish the existence of generalised Sidon sets enjoying additional Ramsey-type properties, which are motivated by questions of Erdős and Newman and of Alon and Erdős.