| 2008 |
|---|
| 33 | EE | Svante Janson,
Andrew Thomason:
Dismantling Sparse Random Graphs.
Combinatorics, Probability & Computing 17(2): 259-264 (2008) |
| 32 | EE | Andrew Thomason:
Disjoint unions of complete minors.
Discrete Mathematics 308(19): 4370-4377 (2008) |
| 31 | EE | Penny E. Haxell,
Oleg Pikhurko,
Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs.
Journal of Graph Theory 57(2): 149-156 (2008) |
| 2007 |
|---|
| 30 | EE | Louigi Addario-Berry,
Ketan Dalal,
Colin McDiarmid,
Bruce A. Reed,
Andrew Thomason:
Vertex-Colouring Edge-Weightings.
Combinatorica 27(1): 1-12 (2007) |
| 29 | EE | Andrew Thomason:
Disjoint complete minors and bipartite minors.
Eur. J. Comb. 28(6): 1779-1783 (2007) |
| 28 | EE | Andrew Thomason,
Peter Wagner:
Complete graphs with no rainbow path.
Journal of Graph Theory 54(3): 261-266 (2007) |
| 2006 |
|---|
| 27 | EE | Béla Bollobás,
Andrew Thomason:
Set colourings of graphs.
Discrete Mathematics 306(10-11): 948-952 (2006) |
| 2005 |
|---|
| 26 | EE | Joseph Samuel Myers,
Andrew Thomason:
The Extremal Function For Noncomplete Minors.
Combinatorica 25(6): 725-753 (2005) |
| 2004 |
|---|
| 25 | | Andrew Thomason:
Two Minor Problems.
Combinatorics, Probability & Computing 13(3): 412 (2004) |
| 24 | EE | William H. Cunningham,
Penny E. Haxell,
R. Bruce Richter,
Nicholas C. Wormald,
Andrew Thomason:
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B 90(1): 1 (2004) |
| 23 | | Felix Lazebnik,
Andrew Thomason:
Orthomorphisms and the construction of projective planes.
Math. Comput. 73(247): 1547-1557 (2004) |
| 2003 |
|---|
| 22 | | Béla Bollobás,
Andrew Thomason:
Frank Ramsey.
Combinatorics, Probability & Computing 12(5-6): 469-475 (2003) |
| 2002 |
|---|
| 21 | EE | Oleg Pikhurko,
Andrew Thomason:
Disjoint subgraphs of large maximum degree.
Discrete Mathematics 248(1-3): 125-141 (2002) |
| 2001 |
|---|
| 20 | EE | Andrew Thomason:
The Extremal Function for Complete Minors.
J. Comb. Theory, Ser. B 81(2): 318-338 (2001) |
| 2000 |
|---|
| 19 | EE | Béla Bollobás,
Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs.
Combinatorica 20(2): 173-202 (2000) |
| 18 | EE | Andrew Thomason:
Subdivisions, linking, minors, and extremal functions.
Electronic Notes in Discrete Mathematics 5: 295-298 (2000) |
| 17 | | Andrew Thomason:
Complete minors in pseudorandom graphs.
Random Struct. Algorithms 17(1): 26-28 (2000) |
| 1999 |
|---|
| 16 | EE | Béla Bollobás,
Andrew Thomason:
Weakly Pancyclic Graphs.
J. Comb. Theory, Ser. B 77(1): 121-137 (1999) |
| 1998 |
|---|
| 15 | | Richard H. Schelp,
Andrew Thomason:
A Remark on the Number of Complete and Empty Subgraphs.
Combinatorics, Probability & Computing 7(2): 217-219 (1998) |
| 14 | EE | Béla Bollobás,
Andrew Thomason:
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.
Eur. J. Comb. 19(8): 883-887 (1998) |
| 1997 |
|---|
| 13 | | Andrew Thomason:
Graph Products and Monochromatic Multiplicities.
Combinatorica 17(1): 125-134 (1997) |
| 1996 |
|---|
| 12 | | Chris Jagger,
Pavel Stovícek,
Andrew Thomason:
Multiplicities of Subgraphs.
Combinatorica 16(1): 123-141 (1996) |
| 11 | | Béla Bollobás,
Andrew Thomason:
Highly Linked Graphs.
Combinatorica 16(3): 313-320 (1996) |
| 1995 |
|---|
| 10 | | Martin E. Dyer,
Trevor I. Fenner,
Alan M. Frieze,
Andrew Thomason:
On Key Storage in Secure Networks.
J. Cryptology 8(4): 189-200 (1995) |
| 9 | | Béla Bollobás,
Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs.
Random Struct. Algorithms 6(2/3): 353-356 (1995) |
| 1992 |
|---|
| 8 | EE | Julie Haviland,
Andrew Thomason:
On testing the 'pseudo-randomness' of a hypergraph.
Discrete Mathematics 103(3): 321-327 (1992) |
| 1991 |
|---|
| 7 | | Béla Bollobás,
Bruce A. Reed,
Andrew Thomason:
An extremal function for the achromatic number.
Graph Structure Theory 1991: 161-166 |
| 6 | | Roland Häggkvist,
Andrew Thomason:
Trees in tournaments.
Combinatorica 11(2): 123-130 (1991) |
| 1989 |
|---|
| 5 | EE | Julie Haviland,
Andrew Thomason:
Pseudo-random hypergraphs.
Discrete Mathematics 75(1-3): 255-278 (1989) |
| 4 | EE | Andrew Thomason:
A simple linear expected time algorithm for finding a hamilton path.
Discrete Mathematics 75(1-3): 373-379 (1989) |
| 3 | EE | Andrew Thomason:
Dense expanders and pseudo-random bipartite graphs.
Discrete Mathematics 75(1-3): 381-386 (1989) |
| 1987 |
|---|
| 2 | | Béla Bollobás,
Andrew Thomason:
Threshold functions.
Combinatorica 7(1): 35-38 (1987) |
| 1982 |
|---|
| 1 | EE | Andrew Thomason:
Critically partitionable graphs II.
Discrete Mathematics 41(1): 67-77 (1982) |
