skip to content

Department of Pure Mathematics and Mathematical Statistics

Professor of Combinatorial Mathematics

Research Interests: Combinatorics, graph theory, algorithms

Publications

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
K Markstrom, A Thomason, P Wagner
– Graphs and Combinatorics
(2010)
27,
243
EXTREMAL GRAPHS AND MULTIGRAPHS WITH TWO WEIGHTED COLOURS
E Marchant, A Thomason
– FETE OF COMBINATORICS AND COMPUTER SCIENCE
(2010)
20,
239
Almost all $H$-free graphs have the Erd\H os-Hajnal property
M Loebl, B Reed, A Scott, A Thomason, S Thomassé
(2010)
21,
405
Vicarious Graphs
T Luczak, A Thomason
– Combinatorics, Probability and Computing
(2009)
19,
819
Weighted spectral distribution for internet topology analysis: Theory and applications
D Fay, H Haddadi, A Thomason, AW Moore, R Mortier, A Jamakovic, S Uhlig, M Rio
– IEEE/ACM Trans. Netw.
(2009)
18,
164
Bounding the size of square-free subgraphs of the hypercube
A Thomason, P Wagner
– Discrete Mathematics
(2009)
309,
1730
An extremal function for contractions of graphs
A THOMASON
– Mathematical Proceedings of the Cambridge Philosophical Society
(2008)
95,
261
Disjoint unions of complete minors
A Thomason
– Discrete Mathematics
(2008)
308,
4370
Dismantling Sparse Random Graphs
S Janson, A Thomason
– Combinatorics Probability Computing
(2008)
17,
259
An upper bound for the κ-Tuple domination number
EJ Cockayne, AG Thomason
– Journal of Combinatorial Mathematics and Combinatorial Computing
(2008)
64,
251
  • <
  • 3 of 10
  • >

Room

C2.03

Telephone

01223 337991