284 citations · 317 across the 9 of their papers we have counts for
9 papers
On the extremal function for graph minors
Andrew Thomason, Matthew Wales
For a graph , let $c(H)=\inf\{c\,:\,e(G)\geq c|G| \mbox{ implies } G\succ H\,\}$, where means that is a minor of . We show that if has average degree ,…
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…
List colourings of multipartite hypergraphs
Arès Méroueh, Andrew Thomason
Let denote the list chromatic number of the -uniform hypergraph~. Extending a result of Alon for graphs, Saxton and the second author used the method of containers t…
Online containers for hypergraphs, with applications to linear equations
David Saxton, Andrew Thomason
A set of containers for a hypergraph G is a collection of vertex subsets, such that for every independent (or, indeed, merely sparse) set in G there is some subset in the collectio…
A Paley-like graph in characteristic two
Andrew Thomason
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields o…
Simple containers for simple hypergraphs
David Saxton, Andrew Thomason
We give an easy method for constructing containers for simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H…