Andrew Thomason

Publication Activity (10 Years)

Years Active: 1979-2020
Publications (10 Years): 4

Top Topics

Kronecker Product

Top Venues

Comb. Probab. Comput.

Electron. J. Comb.

Random Struct. Algorithms

Publications

Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood
A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. 27 (2) (2020)
Arès Méroueh, Andrew Thomason
List colorings of multipartite hypergraphs. Random Struct. Algorithms 55 (4) (2019)
David Saxton, Andrew Thomason
Online containers for hypergraphs, with applications to linear equations. J. Comb. Theory, Ser. B 121 (2016)
David Saxton, Andrew Thomason
Simple Containers for Simple Hypergraphs. Comb. Probab. Comput. 25 (3) (2016)
Andrzej Dudek, Oleg Pikhurko, Andrew Thomason
On Minimum Saturated Matrices. Graphs Comb. 29 (5) (2013)
David Saxton, Andrew Thomason
List Colourings of Regular Hypergraphs. Comb. Probab. Comput. 21 (1-2) (2012)
Klas Markström, Andrew Thomason, Peter Wagner
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs Comb. 27 (2) (2011)
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
Minors in Graphs with High Chromatic Number. Comb. Probab. Comput. 20 (4) (2011)
Edward Marchant, Andrew Thomason
The structure of hereditary properties and 2-coloured multigraphs. Comb. 31 (1) (2011)
Tomasz Luczak, Andrew Thomason
Vicarious Graphs. Comb. Probab. Comput. 19 (5-6) (2010)
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
Hadwiger numbers and over-dominating colourings. Discret. Math. 310 (20) (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) (2010)
Andrew Thomason, Peter Wagner
Bounding the size of square-free subgraphs of the hypercube. Discret. Math. 309 (6) (2009)
Svante Janson, Andrew Thomason
Dismantling Sparse Random Graphs. Comb. Probab. Comput. 17 (2) (2008)
Andrew Thomason
Disjoint unions of complete minors. Discret. Math. 308 (19) (2008)
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57 (2) (2008)
Andrew Thomason, Peter Wagner
Complete graphs with no rainbow path. J. Graph Theory 54 (3) (2007)
Andrew Thomason
Disjoint complete minors and bipartite minors. Eur. J. Comb. 28 (6) (2007)
Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
Vertex-Colouring Edge-Weightings. Comb. 27 (1) (2007)
Béla Bollobás, Andrew Thomason
Set colourings of graphs. Discret. Math. 306 (10-11) (2006)
Joseph Samuel Myers, Andrew Thomason
The Extremal Function For Noncomplete Minors. Comb. 25 (6) (2005)
Andrew Thomason
Two Minor Problems. Comb. Probab. Comput. 13 (3) (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) (2004)
Felix Lazebnik, Andrew Thomason
Orthomorphisms and the construction of projective planes. Math. Comput. 73 (247) (2004)
Béla Bollobás, Andrew Thomason
Frank Ramsey. Comb. Probab. Comput. 12 (5-6) (2003)
Oleg Pikhurko, Andrew Thomason
Disjoint subgraphs of large maximum degree. Discret. Math. 248 (1-3) (2002)
Andrew Thomason
The Extremal Function for Complete Minors. J. Comb. Theory, Ser. B 81 (2) (2001)
Andrew Thomason
Subdivisions, linking, minors, and extremal functions. Electron. Notes Discret. Math. 5 (2000)
Béla Bollobás, Andrew Thomason
The Structure of Hereditary Properties and Colourings of Random Graphs. Comb. 20 (2) (2000)
Andrew Thomason
Complete minors in pseudorandom graphs. Random Struct. Algorithms 17 (1) (2000)
Richard H. Schelp, Andrew Thomason
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. J. Graph Theory 33 (2) (2000)
Béla Bollobás, Andrew Thomason
Weakly Pancyclic Graphs. J. Comb. Theory, Ser. B 77 (1) (1999)
Richard H. Schelp, Andrew Thomason
A Remark on the Number of Complete and Empty Subgraphs. Comb. Probab. Comput. 7 (2) (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) (1998)
Andrew Thomason
Graph Products and Monochromatic Multiplicities. Comb. 17 (1) (1997)
Béla Bollobás, Andrew Thomason
On the girth of hamiltonian weakly pancyclic graphs. J. Graph Theory 26 (3) (1997)
Chris Jagger, Pavel Stovícek, Andrew Thomason
Multiplicities of Subgraphs. Comb. 16 (1) (1996)
Béla Bollobás, Andrew Thomason
Highly Linked Graphs. Comb. 16 (3) (1996)
Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
On Key Storage in Secure Networks. J. Cryptol. 8 (4) (1995)
Béla Bollobás, Andrew Thomason
Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6 (2/3) (1995)
Roland Häggkvist, Andrew Thomason
Oriented hamilton cycles in digraphs. J. Graph Theory 19 (4) (1995)
Julie Haviland, Andrew Thomason
Rotation numers for complete bipartite graphs. J. Graph Theory 16 (1) (1992)
Julie Haviland, Andrew Thomason
On testing the 'pseudo-randomness' of a hypergraph. Discret. Math. 103 (3) (1992)
Julie Haviland, Andrew Thomason
Rotation numbers for complete tripartite graphs. Graphs Comb. 7 (2) (1991)
Béla Bollobás, Bruce A. Reed, Andrew Thomason
An extremal function for the achromatic number. Graph Structure Theory (1991)
Roland Häggkvist, Andrew Thomason
Trees in tournaments. Comb. 11 (2) (1991)
Andrew Thomason
A simple linear expected time algorithm for finding a hamilton path. Discret. Math. 75 (1-3) (1989)
Andrew Thomason
Dense expanders and pseudo-random bipartite graphs. Discret. Math. 75 (1-3) (1989)
Julie Haviland, Andrew Thomason
Pseudo-random hypergraphs. Discret. Math. 75 (1-3) (1989)
Andrew Thomason
A Graph Property not Satisfying a 'Zero-One Law'. Eur. J. Comb. 9 (6) (1988)
Andrew Thomason
An upper bound for some ramsey numbers. J. Graph Theory 12 (4) (1988)
Béla Bollobás, Andrew Thomason
Threshold functions. Comb. 7 (1) (1987)
Béla Bollobás, Andrew Thomason
Parallel sorting. Discret. Appl. Math. 6 (1) (1983)
Andrew Thomason
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. J. Graph Theory 6 (2) (1982)
Andrew Thomason
Critically partitionable graphs II. Discret. Math. 41 (1) (1982)
Andrew Thomason
On Finite Ramsey Numbers. Eur. J. Comb. 3 (3) (1982)
Béla Bollobás, Andrew Thomason
Graphs which Contain all Small Graphs. Eur. J. Comb. 2 (1) (1981)
Béla Bollobás, Andrew Thomason
Dense neighbourhoods and Turán's theorem. J. Comb. Theory, Ser. B 31 (3) (1981)
Béla Bollobás, Andrew Thomason
Set colourings of graphs. Discret. Math. 25 (1) (1979)