4 papers
The codegree Turán density of tight cycles minus one edge
Simón Piga, Marcelo Sales, Bjarne Schülke
Given and an integer , we prove that every sufficiently large -uniform hypergraph on vertices in which every two vertices are contained in at least …
Every Steiner triple system contains an almost spanning d-ary hypertree
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
In this paper we make a partial progress on the following conjecture: for every and large enough , every Steiner triple system on at least vertices contains e…
Colourful matchings
Andrii Arman, Vojtěch Rödl, Marcelo Tadeu Sales
Suppose a committee consisting of three members has to match candidates to different positions. Each member of the committee proposes a matching, however the proposed match…
A blurred view of Van der Waerden type theorems
Vojtech Rödl, Marcelo Sales
Let be an arithmetic progression. For we call a set an -approximate arithmetic progression if for some $a…