76 citations · 568 across the 46 of their papers we have counts for
4 papers · 1 filter
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…
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
Bhargav Narayanan, Mathias Schacht
For positive integers , an -uniform hypergraph is called an -cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of …
Odd cycles in subgraphs of sparse pseudorandom graphs
Sören Berger, Joonkyung Lee, Mathias Schacht
We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let be an -graph, i.e., -vertex, -regular grap…
On the size-Ramsey number of grid graphs
Dennis Clemens, Meysam Miralaei, Damian Reding +2
The size-Ramsey number of a graph is the smallest number of edges in a graph with the Ramsey property for , that is, with the property that any 2-colouring of the edges…