76 citations · 568 across the 46 of their papers we have counts for
25 papers · 1 filter
Monochromatic trees in random graphs
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
Bal and DeBiasio [Partitioning random graphs into monochromatic components, Electron. J. Combin. 24 (2017), Paper 1.18] put forward a conjecture concerning the threshold for the fo…
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…
On the Hamiltonicity of triple systems with high minimum degree
Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht +1
We show that every 3-uniform hypergraph with minimum vertex degree at least contains a tight Hamiltonian cycle.
Ramsey-type numbers involving graphs and hypergraphs with large girth
H. Hàn, T. Retter, V. Rödl +1
A question of Erdős asks if for every pair of positive integers and , there exists a graph having and the property that every -colouring of the…