Andrew Thomason

According to our database1, Andrew Thomason authored at least 59 papers between 1981 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Lower Bound on the Average Degree Forcing a Minor.
Electron. J. Comb., 2020

2019
List colorings of multipartite hypergraphs.
Random Struct. Algorithms, 2019

2016
Online containers for hypergraphs, with applications to linear equations.
J. Comb. Theory, Ser. B, 2016

Simple Containers for Simple Hypergraphs.
Comb. Probab. Comput., 2016

2013
On Minimum Saturated Matrices.
Graphs Comb., 2013

Hereditary and Monotone Properties of Graphs.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
List Colourings of Regular Hypergraphs.
Comb. Probab. Comput., 2012

2011
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.
Graphs Comb., 2011

Minors in Graphs with High Chromatic Number.
Comb. Probab. Comput., 2011

The structure of hereditary properties and 2-coloured multigraphs.
Comb., 2011

2010
Weighted spectral distribution for internet topology analysis: theory and applications.
IEEE/ACM Trans. Netw., 2010

Hadwiger numbers and over-dominating colourings.
Discret. Math., 2010

Vicarious Graphs.
Comb. Probab. Comput., 2010

2009
Bounding the size of square-free subgraphs of the hypercube.
Discret. Math., 2009

2008
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory, 2008

Disjoint unions of complete minors.
Discret. Math., 2008

Dismantling Sparse Random Graphs.
Comb. Probab. Comput., 2008

2007
Complete graphs with no rainbow path.
J. Graph Theory, 2007

Disjoint complete minors and bipartite minors.
Eur. J. Comb., 2007

Vertex-Colouring Edge-Weightings.
Comb., 2007

2006
Set colourings of graphs.
Discret. Math., 2006

2005
The Extremal Function For Noncomplete Minors.
Comb., 2005

2004
Orthomorphisms and the construction of projective planes.
Math. Comput., 2004

To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B, 2004

Two Minor Problems.
Comb. Probab. Comput., 2004

2003
Frank Ramsey.
Comb. Probab. Comput., 2003

2002
Disjoint subgraphs of large maximum degree.
Discret. Math., 2002

2001
The Extremal Function for Complete Minors.
J. Comb. Theory, Ser. B, 2001

2000
Complete minors in pseudorandom graphs.
Random Struct. Algorithms, 2000

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.
J. Graph Theory, 2000

Subdivisions, linking, minors, and extremal functions.
Electron. Notes Discret. Math., 2000

The Structure of Hereditary Properties and Colourings of Random Graphs.
Comb., 2000

1999
Weakly Pancyclic Graphs.
J. Comb. Theory, Ser. B, 1999

1998
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.
Eur. J. Comb., 1998

A Remark on the Number of Complete and Empty Subgraphs.
Comb. Probab. Comput., 1998

1997
On the girth of hamiltonian weakly pancyclic graphs.
J. Graph Theory, 1997

Graph Products and Monochromatic Multiplicities.
Comb., 1997

1996
Multiplicities of Subgraphs.
Comb., 1996

Highly Linked Graphs.
Comb., 1996

1995
Generalized Chromatic Numbers of Random Graphs.
Random Struct. Algorithms, 1995

On Key Storage in Secure Networks.
J. Cryptol., 1995

Oriented hamilton cycles in digraphs.
J. Graph Theory, 1995

1992
Rotation numers for complete bipartite graphs.
J. Graph Theory, 1992

On testing the 'pseudo-randomness' of a hypergraph.
Discret. Math., 1992

1991
Rotation numbers for complete tripartite graphs.
Graphs Comb., 1991

Trees in tournaments.
Comb., 1991

An extremal function for the achromatic number.
Proceedings of the Graph Structure Theory, 1991

1989
Dense expanders and pseudo-random bipartite graphs.
Discret. Math., 1989

A simple linear expected time algorithm for finding a hamilton path.
Discret. Math., 1989

Pseudo-random hypergraphs.
Discret. Math., 1989

1988
An upper bound for some ramsey numbers.
J. Graph Theory, 1988

A Graph Property not Satisfying a 'Zero-One Law'.
Eur. J. Comb., 1988

1987
Threshold functions.
Comb., 1987

1983
Parallel sorting.
Discret. Appl. Math., 1983

1982
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable.
J. Graph Theory, 1982

On Finite Ramsey Numbers.
Eur. J. Comb., 1982

Critically partitionable graphs II.
Discret. Math., 1982

1981
Dense neighbourhoods and Turán's theorem.
J. Comb. Theory, Ser. B, 1981

Graphs which Contain all Small Graphs.
Eur. J. Comb., 1981


  Loading...