Professor Andrew Thomason | Department of Pure Mathematics and Mathematical Statistics

skip to content

Professor of Combinatorial Mathematics

Research Interests: Combinatorics, graph theory, algorithms

Publications

On the extremal function for graph minors

A Thomason, M Wales

– Bolyai Society Mathematical Studies

(2022)

15,

66

(doi: 10.1002/jgt.22811)

A Lower Bound on the Average Degree Forcing a Minor

S Norin, B Reed, A Thomason, DR Wood

– The Electronic Journal of Combinatorics

(2020)

27,

ARTN P2.4

(doi: 10.37236/8847)

On Some Cycles in Wenger Graphs

Y Wang, F Lazebnik, A Thomason

– Acta Mathematicae Applicatae Sinica, English Series

(2020)

36,

492

(doi: 10.1007/s10255-020-0927-2)

List colorings of multipartite hypergraphs

A Meroueh, A Thomason

– Random Structures & Algorithms

(2019)

55,

950

(doi: 10.1002/rsa.20848)

Frank Ramsey

B Bollobás, A Thomason

– Combinatorics Probability Computing

(2017)

12,

469

(doi: 10.1017/s0963548303005789)

Frank Ramsey

B Bollobas, A Thomason

– Combinatorics, Probability and Computing

(2017)

12,

469

(doi: 10.1017/s0963548303005789)

Uniquely partitionable graphs

B BOLLOBAS, AG THOMASON

– Journal of the London Mathematical Society

(2016)

s2-16,

404

(doi: 10.1112/jlms/s2-16.3.403)

Projections of bodies and hereditary properties of hypergraphs

B BOLLOBAS, A THOMASON

– Bulletin of the London Mathematical Society

(2016)

27,

417

(doi: 10.1112/blms/27.5.417)

Online containers for hypergraphs, with applications to linear equations

D Saxton, A Thomason

– Journal of Combinatorial Theory, Series B

(2016)

121,

248

(doi: 10.1016/j.jctb.2016.05.011)

Simple Containers for Simple Hypergraphs

D Saxton, A Thomason

– Combinatorics Probability Computing

(2016)

25,

448

(doi: 10.1017/S096354831500022X)