6 papers
On Ramsey number of Steiner systems
Ayush Basu, Daniel Dobak, VojtÄch Rödl +1
A -uniform hypergraph is called a partial -system if every set of vertices of is contained in at most one edge of . We prove the existence of a pa…
Nowhere dense Ramsey sets
VojtÄch Rödl, Marcelo Sales
A set of points in Euclidean space is called \textit{Ramsey} if any finite partition of yields a monochromatic copy of . While character…
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.
Note on set representation of bounded degree hypergaphs
Ayush Basu, Griffin Johnston, VojtÄch Rödl +1
In their classical paper, ErdÅs, Goodman and Pósa studied the representation of a graph with vertex set by a family of subsets with the property that $\{i,…
Coloring triangles in graphs
Ayush Basu, VojtÄch Rödl, Marcelo Sales
We study quantitative aspects of the following fact: For every graph , there exists a graph with the property that any -coloring of the triangles of yields an induced…
Colouring versus density in integers and Hales-Jewett cubes
Christian Reiher, VojtÄch Rödl, Marcelo Sales
We construct for every integer and every real a set of integers which, when coloured with finitely many colours, contains a monochr…