Andrew Thomason

61 papers Journal 59Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
On the extremal function for graph minors.
J. Graph Theory
Andrew Thomason, Matthew Wales
2020 J jnl
A Lower Bound on the Average Degree Forcing a Minor.
Electron. J. Comb.
Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood
2019 J jnl
List colorings of multipartite hypergraphs.
Random Struct. Algorithms
Arès Méroueh, Andrew Thomason
2016 J jnl
Online containers for hypergraphs, with applications to linear equations.
J. Comb. Theory B
David Saxton, Andrew Thomason
2016 J jnl
Simple Containers for Simple Hypergraphs.
Comb. Probab. Comput.
David Saxton, Andrew Thomason
2013 — ch.
Hereditary and Monotone Properties of Graphs.
The Mathematics of Paul Erdős II
Béla Bollobás, Andrew Thomason
2013 J jnl
On Minimum Saturated Matrices.
Graphs Comb.
Andrzej Dudek, Oleg Pikhurko, Andrew Thomason
2012 J jnl
List Colourings of Regular Hypergraphs.
Comb. Probab. Comput.
David Saxton, Andrew Thomason
2011 J jnl
Minors in Graphs with High Chromatic Number.
Comb. Probab. Comput.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2011 J jnl
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.
Graphs Comb.
Klas Markström, Andrew Thomason, Peter Wagner
2011 J jnl
The structure of hereditary properties and 2-coloured multigraphs.
Comb.
Edward Marchant, Andrew Thomason
2010 J jnl
Hadwiger numbers and over-dominating colourings.
Discret. Math.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2010 J jnl
Vicarious Graphs.
Comb. Probab. Comput.
Tomasz Luczak, Andrew Thomason
2010 J jnl
Weighted spectral distribution for internet topology analysis: theory and applications.
IEEE/ACM Trans. Netw.
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew W. Moore, Richard Mortier, Almerima Jamakovic, Steve Uhlig, Miguel Rio
2009 J jnl
Bounding the size of square-free subgraphs of the hypercube.
Discret. Math.
Andrew Thomason, Peter Wagner
2008 J jnl
Disjoint unions of complete minors.
Discret. Math.
Andrew Thomason
2008 J jnl
Dismantling Sparse Random Graphs.
Comb. Probab. Comput.
Svante Janson, Andrew Thomason
2008 J jnl
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
2007 J jnl
Complete graphs with no rainbow path.
J. Graph Theory
Andrew Thomason, Peter Wagner
2007 J jnl
Disjoint complete minors and bipartite minors.
Eur. J. Comb.
Andrew Thomason
2007 J jnl
Vertex-Colouring Edge-Weightings.
Comb.
Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
2006 J jnl
Set colourings of graphs.
Discret. Math.
Béla Bollobás, Andrew Thomason
2005 J jnl
The Extremal Function For Noncomplete Minors.
Comb.
Joseph Samuel Myers, Andrew Thomason
2004 J jnl
Orthomorphisms and the construction of projective planes.
Math. Comput.
Felix Lazebnik, Andrew Thomason
2004 J jnl
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory B
William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
2004 J jnl
Two Minor Problems.
Comb. Probab. Comput.
Andrew Thomason
2003 J jnl
Frank Ramsey.
Comb. Probab. Comput.
Béla Bollobás, Andrew Thomason
2002 J jnl
Disjoint subgraphs of large maximum degree.
Discret. Math.
Oleg Pikhurko, Andrew Thomason
2001 J jnl
The Extremal Function for Complete Minors.
J. Comb. Theory B
Andrew Thomason
2000 J jnl
Complete minors in pseudorandom graphs.
Random Struct. Algorithms
Andrew Thomason
2000 J jnl
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.
J. Graph Theory
Richard H. Schelp, Andrew Thomason
2000 J jnl
Subdivisions, linking, minors, and extremal functions.
Electron. Notes Discret. Math.
Andrew Thomason
2000 J jnl
The Structure of Hereditary Properties and Colourings of Random Graphs.
Comb.
Béla Bollobás, Andrew Thomason
1999 J jnl
Weakly Pancyclic Graphs.
J. Comb. Theory B
Béla Bollobás, Andrew Thomason
1998 J jnl
A Remark on the Number of Complete and Empty Subgraphs.
Comb. Probab. Comput.
Richard H. Schelp, Andrew Thomason
1998 J jnl
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.
Eur. J. Comb.
Béla Bollobás, Andrew Thomason
1997 J jnl
Graph Products and Monochromatic Multiplicities.
Comb.
Andrew Thomason
1997 J jnl
On the girth of hamiltonian weakly pancyclic graphs.
J. Graph Theory
Béla Bollobás, Andrew Thomason
1996 J jnl
Highly Linked Graphs.
Comb.
Béla Bollobás, Andrew Thomason
1996 J jnl
Multiplicities of Subgraphs.
Comb.
Chris Jagger, Pavel Stovícek, Andrew Thomason
1995 J jnl
Generalized Chromatic Numbers of Random Graphs.
Random Struct. Algorithms
Béla Bollobás, Andrew Thomason
1995 J jnl
On Key Storage in Secure Networks.
J. Cryptol.
Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
1995 J jnl
Oriented hamilton cycles in digraphs.
J. Graph Theory
Roland Häggkvist, Andrew Thomason
1992 J jnl
On testing the 'pseudo-randomness' of a hypergraph.
Discret. Math.
Julie Haviland, Andrew Thomason
1992 J jnl
Rotation numers for complete bipartite graphs.
J. Graph Theory
Julie Haviland, Andrew Thomason
1991 — conf
An extremal function for the achromatic number.
Graph Structure Theory
Béla Bollobás, Bruce A. Reed, Andrew Thomason
1991 J jnl
Rotation numbers for complete tripartite graphs.
Graphs Comb.
Julie Haviland, Andrew Thomason
1991 J jnl
Trees in tournaments.
Comb.
Roland Häggkvist, Andrew Thomason
1989 J jnl
A simple linear expected time algorithm for finding a hamilton path.
Discret. Math.
Andrew Thomason
1989 J jnl
Dense expanders and pseudo-random bipartite graphs.
Discret. Math.
Andrew Thomason
1989 J jnl
Pseudo-random hypergraphs.
Discret. Math.
Julie Haviland, Andrew Thomason
1988 J jnl
A Graph Property not Satisfying a 'Zero-One Law'.
Eur. J. Comb.
Andrew Thomason
1988 J jnl
An upper bound for some ramsey numbers.
J. Graph Theory
Andrew Thomason
1987 J jnl
Threshold functions.
Comb.
Béla Bollobás, Andrew Thomason
1983 J jnl
Parallel sorting.
Discret. Appl. Math.
Béla Bollobás, Andrew Thomason
1982 J jnl
Critically partitionable graphs II.
Discret. Math.
Andrew Thomason
1982 J jnl
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable.
J. Graph Theory
Andrew Thomason
1982 J jnl
On Finite Ramsey Numbers.
Eur. J. Comb.
Andrew Thomason
1981 J jnl
Dense neighbourhoods and Turán's theorem.
J. Comb. Theory B
Béla Bollobás, Andrew Thomason
1981 J jnl
Graphs which Contain all Small Graphs.
Eur. J. Comb.
Béla Bollobás, Andrew Thomason
1979 J jnl
Set colourings of graphs.
Discret. Math.
Béla Bollobás, Andrew Thomason