109 citations · 453 across the 60 of their papers we have counts for
9 papers · 1 filter
Squares of Hamiltonian cycles in 3-uniform hypergraphs
Wiebke Bedenknecht, Christian Reiher
We show that every -uniform hypergraph with and minimum pair degree at least contains a squared Hamiltonian cycle. This may be regarded as a f…
Forcing quasirandomness with triangles
Christian Reiher, Mathias Schacht
We study forcing pairs for quasirandom graphs. Chung, Graham, and Wilson initiated the study of families of graphs with the property that if a large graph has app…
Weighted variants of the Andrásfai-Erdős-Sós Theorem
Clara M. Lüders, Christian Reiher
A well known result due to Andrásfai, Erdős, and Sós asserts that for every -free graph on vertices with is -partite. We study re…
The Ramsey-Turán problem for cliques
Clara M. Lüders, Christian Reiher
An important question in extremal graph theory raised by Vera T. Sós asks to determine for a given integer and a given positive real number the asymptotically supremal…
Maximum star densities
Christian Reiher, Stephan Wagner
Given an integer and a real number , which graphs of edge density contain the largest number of -edge stars? For Ahlswede and Katona proved tha…
A tale of stars and cliques
Tomasz Łuczak, Joanna Polcyn, Christian Reiher
We show that for an infinitely many natural numbers there are -uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}…
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
P. Erdős [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs that have to appear in any suf…
Decomposing graphs into forests
Christian Reiher, Lisa Sauermann
We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this sta…
Borsuk and Ramsey type questions in Euclidean space
Peter Frankl, János Pach, Christian Reiher +1
We give a short survey of problems and results on (1) diameter graphs and hypergraphs, and (2) geometric Ramsey theory. We also make some modest contributions to both areas. Extend…