Andrew Thomason

David Saxton, Andrew Thomason: List Colourings of Regular Hypergraphs. Combinatorics, Probability & Computing 21(1-2): 315-322 (2012)

Edward Marchant, Andrew Thomason: The structure of hereditary properties and 2-coloured multigraphs. Combinatorica 31(1): 85-93 (2011)

Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason: Minors in Graphs with High Chromatic Number. Combinatorics, Probability & Computing 20(4): 513-518 (2011)

Klas Markström, Andrew Thomason, Peter Wagner: Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs and Combinatorics 27(2): 243-249 (2011)

Tomasz Luczak, Andrew Thomason: Vicarious Graphs. Combinatorics, Probability & Computing 19(5-6): 819-827 (2010)

Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason: Hadwiger numbers and over-dominating colourings. Discrete Mathematics 310(20): 2662-2665 (2010)

Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew W. Moore, Richard Mortier, Almerima Jamakovic, Steve Uhlig, Miguel Rio: Weighted spectral distribution for internet topology analysis: theory and applications. IEEE/ACM Trans. Netw. 18(1): 164-176 (2010)

Andrew Thomason, Peter Wagner: Bounding the size of square-free subgraphs of the hypercube. Discrete Mathematics 309(6): 1730-1735 (2009)

Svante Janson, Andrew Thomason: Dismantling Sparse Random Graphs. Combinatorics, Probability & Computing 17(2): 259-264 (2008)

Andrew Thomason: Disjoint unions of complete minors. Discrete Mathematics 308(19): 4370-4377 (2008)

Penny E. Haxell, Oleg Pikhurko, Andrew Thomason: Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory 57(2): 149-156 (2008)

Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason: Vertex-Colouring Edge-Weightings. Combinatorica 27(1): 1-12 (2007)

Andrew Thomason: Disjoint complete minors and bipartite minors. Eur. J. Comb. 28(6): 1779-1783 (2007)

Andrew Thomason, Peter Wagner: Complete graphs with no rainbow path. Journal of Graph Theory 54(3): 261-266 (2007)

Béla Bollobás, Andrew Thomason: Set colourings of graphs. Discrete Mathematics 306(10-11): 948-952 (2006)

Joseph Samuel Myers, Andrew Thomason: The Extremal Function For Noncomplete Minors. Combinatorica 25(6): 725-753 (2005)

Andrew Thomason: Two Minor Problems. Combinatorics, Probability & Computing 13(3): 412 (2004)

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)

Felix Lazebnik, Andrew Thomason: Orthomorphisms and the construction of projective planes. Math. Comput. 73(247): 1547-1557 (2004)

Béla Bollobás, Andrew Thomason: Frank Ramsey. Combinatorics, Probability & Computing 12(5-6): 469-475 (2003)

Oleg Pikhurko, Andrew Thomason: Disjoint subgraphs of large maximum degree. Discrete Mathematics 248(1-3): 125-141 (2002)

Andrew Thomason: The Extremal Function for Complete Minors. J. Comb. Theory, Ser. B 81(2): 318-338 (2001)

Béla Bollobás, Andrew Thomason: The Structure of Hereditary Properties and Colourings of Random Graphs. Combinatorica 20(2): 173-202 (2000)

Andrew Thomason: Subdivisions, linking, minors, and extremal functions. Electronic Notes in Discrete Mathematics 5: 295-298 (2000)

Richard H. Schelp, Andrew Thomason: On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. Journal of Graph Theory 33(2): 66-82 (2000)

Andrew Thomason: Complete minors in pseudorandom graphs. Random Struct. Algorithms 17(1): 26-28 (2000)

Béla Bollobás, Andrew Thomason: Weakly Pancyclic Graphs. J. Comb. Theory, Ser. B 77(1): 121-137 (1999)

Richard H. Schelp, Andrew Thomason: A Remark on the Number of Complete and Empty Subgraphs. Combinatorics, Probability & Computing 7(2): 217-219 (1998)

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)

Andrew Thomason: Graph Products and Monochromatic Multiplicities. Combinatorica 17(1): 125-134 (1997)

Béla Bollobás, Andrew Thomason: On the girth of hamiltonian weakly pancyclic graphs. Journal of Graph Theory 26(3): 165-173 (1997)

Chris Jagger, Pavel Stovícek, Andrew Thomason: Multiplicities of Subgraphs. Combinatorica 16(1): 123-141 (1996)

Béla Bollobás, Andrew Thomason: Highly Linked Graphs. Combinatorica 16(3): 313-320 (1996)

Roland Häggkvist, Andrew Thomason: Oriented hamilton cycles in digraphs. Journal of Graph Theory 19(4): 471-479 (1995)

Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason: On Key Storage in Secure Networks. J. Cryptology 8(4): 189-200 (1995)

Béla Bollobás, Andrew Thomason: Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6(2/3): 353-356 (1995)

Julie Haviland, Andrew Thomason: On testing the 'pseudo-randomness' of a hypergraph. Discrete Mathematics 103(3): 321-327 (1992)

Julie Haviland, Andrew Thomason: Rotation numers for complete bipartite graphs. Journal of Graph Theory 16(1): 61-71 (1992)

Roland Häggkvist, Andrew Thomason: Trees in tournaments. Combinatorica 11(2): 123-130 (1991)

Julie Haviland, Andrew Thomason: Rotation numbers for complete tripartite graphs. Graphs and Combinatorics 7(2): 153-163 (1991)

Béla Bollobás, Bruce A. Reed, Andrew Thomason: An extremal function for the achromatic number. Graph Structure Theory 1991: 161-166

Julie Haviland, Andrew Thomason: Pseudo-random hypergraphs. Discrete Mathematics 75(1-3): 255-278 (1989)

Andrew Thomason: A simple linear expected time algorithm for finding a hamilton path. Discrete Mathematics 75(1-3): 373-379 (1989)

Andrew Thomason: Dense expanders and pseudo-random bipartite graphs. Discrete Mathematics 75(1-3): 381-386 (1989)

Andrew Thomason: An upper bound for some ramsey numbers. Journal of Graph Theory 12(4): 509-517 (1988)

Béla Bollobás, Andrew Thomason: Threshold functions. Combinatorica 7(1): 35-38 (1987)

Andrew Thomason: Critically partitionable graphs II. Discrete Mathematics 41(1): 67-77 (1982)