109 citations · 453 across the 60 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Embedding spanning subgraphs in uniformly dense and inseparable graphs
Oliver Ebsen, Giulia S. Maesaka, Christian Reiher +2
We consider sufficient conditions for the existence of -th powers of Hamiltonian cycles in -vertex graphs with minimum degree for arbitrarily small . About 20 y…
math.CO2019★ 19 cited
Extremal problems in uniformly dense hypergraphs
Christian Reiher
For a -uniform hypergraph let be the maximum number of edges of a -uniform -vertex hypergraph which contains no copy of . Determining or esti…