8 citations · 31 across the 24 of their papers we have counts for
4 papers · 1 filter
Connector-Breaker games on random boards
Dennis Clemens, Laurin Kirsch, Yannick Mogge
By now, the Maker-Breaker connectivity game on a complete graph or on a random graph is well studied. Recently, London and Pluhár suggested a variant in which…
Perfectly packing graphs with bounded degeneracy and many leaves
Peter Allen, Julia Böttcher, Dennis Clemens +1
We prove that one can perfectly pack degenerate graphs into complete or dense -vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}…
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…
A Dirac-type theorem for Berge cycles in random hypergraphs
Dennis Clemens, Julia Ehrenmüller, Yury Person
A Hamilton Berge cycle of a hypergraph on vertices is an alternating sequence of distinct vertices and distinct hyperedge…