7 citations · 13 across the 23 of their papers we have counts for
7 papers · 1 filter
On quantitative aspects of a canonisation theorem for edge-orderings
Christian Reiher, Vojtěch Rödl, Marcelo Sales +2
For integers and there are canonical orderings of the edges of the complete -uniform hypergraph with vertex set . These are…
Sandwiching biregular random graphs
Tereza Klimošová, Christian Reiher, Andrzej Ruciński +1
Let be a uniformly random -edge subgraph of the complete bipartite graph with bipartition , where . Given a real number $p \in [0,1…
On Hamiltonian cycles in hypergraphs with dense link graphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl +1
We show that every -uniform hypergraph on vertices whose minimum -degree is at least contains a Hamiltonian cycle. A construction due to Han and Zha…
Minimum pair degree condition for tight Hamiltonian cycles in -uniform hypergraphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl +3
We show that every 4-uniform hypergraph with vertices and minimum pair degree at least contains a tight Hamiltonian cycle. This degree condition is asymptotic…
High powers of Hamiltonian cycles in randomly augmented graphs
Sylwia Antoniuk, Andrzej Dudek, Christian Reiher +2
We investigate the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. For all integers…
Andrásfai and Vega graphs in Ramsey-Turán theory
Tomasz Łuczak, Joanna Polcyn, Christian Reiher
Given positive integers , we let denote the maximum number of edges in a triangle-free graph on vertices with . In the early sixties…