101 citations · 240 across the 32 of their papers we have counts for
35 papers
The Speed and Threshold of the Biased Hamilton Cycle Game
Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3
We show that there is a constant C such that for any , Maker wins the Maker-Breaker Hamilton cycle game in $n+\frac{Cn}{\sqrt{\ln{n}}}…
The Speed and Threshold of the Biased Perfect Matching Game
Noah Brustle, Sarah Clusiau, Vishnu V. Narayan +3
We show that Maker wins the Maker-Breaker perfect matching game in turns when the bias is at least , for any …
Tight Bounds on the Clique Chromatic Number
Gwenaël Joret, Piotr Micek, Bruce Reed +1
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is mo…
Notes on Tree- and Path-chromatic Number
Tony Huynh, Bruce Reed, David R. Wood +1
Tree-chromatic number is a chromatic version of treewidth, where the cost of a bag in a tree-decomposition is measured by its chromatic number rather than its size. Path-chromatic…
A lower bound on the average degree forcing a minor
Sergey Norin, Bruce Reed, Andrew Thomason +1
We show that for sufficiently large and for , there is a graph with average degree such that almost every graph with ver…
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex II: A Tight Result
Bruce Reed, Maya Stein
We prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree…