109 citations · 453 across the 60 of their papers we have counts for
11 papers · 1 filter
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
Christian Reiher, Vojtěch Rödl, Andrzej Ruciński +2
We show that every 3-uniform hypergraph with vertices and minimum vertex degree at least contains a tight Hamiltonian cycle. Known lower bound constructi…
On the local density problem for graphs of given odd-girth
Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher +1
Erdős conjectured that every -vertex triangle-free graph contains a subset of vertices that spans at most edges. Extending a recent result of Norin…
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
For a -uniform hypergraph let be the maximum number of edges of a -uniform -vertex hypergraph which contains no copy of . Determining or esti…
A Ramsey Class for Steiner Systems
Vindya Bhat, Jaroslav Nešetřil, Christian Reiher +1
We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general -uniform hypergraphs, it turns out that simply putting linear orders on…
Counting odd cycles in locally dense graphs
Christian Reiher
We prove that for any given and , every sufficiently large -dense graph contains for each odd integer at least $(d^r-\varepsil…
The parity search problem
Christian Reiher
We prove that for any positive integers and there exists a collection consisting of subsets of such that for any two distinct…
On Kemnitz' Conjecture Concerning Lattice Points in the Plane
Christian Reiher
In 1961, P. Erdős, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of integers contains a subset of size , the sum of whose elements is divisibl…
The chromatic number of finite type-graphs
Christian Avart, Bill Kay, Christian Reiher +1
By a finite type-graph we mean a graph whose set of vertices is the set of all -subsets of for some integers , and in which two such sets ar…
Some remarks on the extremal function for uniformly two-path dense hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
We investigate extremal problems for hypergraphs satisfying the following density condition. A -uniform hypergraph is -dense if for any two subsets of pai…
On a Turán problem in weakly quasirandom 3-uniform hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
Extremal problems for -uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extre…
Embedding tetrahedra into quasirandom hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
We investigate extremal problems for quasirandom hypergraphs. We say that a -uniform hypergraph is -quasirandom if for any subset and every set o…