Dennis Clemens

According to our database1, Dennis Clemens authored at least 19 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On minimal Ramsey graphs and Ramsey equivalence in multiple colours.
Comb. Probab. Comput., 2020

Fast Strategies in Waiter-Client Games.
Electron. J. Comb., 2020

A Dirac-type Theorem for Berge Cycles in Random Hypergraphs.
Electron. J. Comb., 2020

2019
The size?Ramsey number of powers of paths.
J. Graph Theory, 2019

2018
Colourings without monochromatic disjoint pairs.
Eur. J. Comb., 2018

How fast can Maker win in fair biased games?
Discret. Math., 2018

2017
A non-trivial upper bound on the threshold bias of the Oriented-cycle game.
J. Comb. Theory, Ser. B, 2017

On sets not belonging to algebras and rainbow matchings in graphs.
J. Comb. Theory, Ser. B, 2017

2016
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.
Electron. Notes Discret. Math., 2016

Creating cycles in Walker-Breaker games.
Discret. Math., 2016

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2016

The Random Graph Intuition for the Tournament Game.
Comb. Probab. Comput., 2016

An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching.
Electron. J. Comb., 2016

2015
Building Spanning Trees Quickly in Maker-Breaker Games.
SIAM J. Discret. Math., 2015

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2015

Winning fast in fair biased Maker-Breaker games.
Electron. Notes Discret. Math., 2015

A Remark on the Tournament Game.
Electron. J. Comb., 2015

Keeping Avoider's Graph Almost Acyclic.
Electron. J. Comb., 2015

2012
Fast Strategies In Maker-Breaker Games Played on Random Boards.
Comb. Probab. Comput., 2012


  Loading...