default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Thomason 0001
Person information
- affiliation: University of Cambridge, Department of Pure Mathematics and Mathematical Statistics, United Kingdom
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j63]Andrew Thomason
, Matthew Wales:
On the extremal function for graph minors. J. Graph Theory 101(1): 66-78 (2022)- 2020
- [j62]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): 2 (2020)
2010 – 2019
- 2019
- [j61]Arès Méroueh, Andrew Thomason:
List colorings of multipartite hypergraphs. Random Struct. Algorithms 55(4): 950-979 (2019) - 2016
- [j60]David Saxton, Andrew Thomason:
Simple Containers for Simple Hypergraphs. Comb. Probab. Comput. 25(3): 448-459 (2016) - [j59]David Saxton, Andrew Thomason:
Online containers for hypergraphs, with applications to linear equations. J. Comb. Theory B 121: 248-283 (2016) - 2013
- [j58]Andrzej Dudek, Oleg Pikhurko, Andrew Thomason:
On Minimum Saturated Matrices. Graphs Comb. 29(5): 1269-1286 (2013) - [p1]Béla Bollobás, Andrew Thomason:
Hereditary and Monotone Properties of Graphs. The Mathematics of Paul Erdős II 2013: 69-80 - 2012
- [j57]David Saxton, Andrew Thomason:
List Colourings of Regular Hypergraphs. Comb. Probab. Comput. 21(1-2): 315-322 (2012) - 2011
- [j56]Edward Marchant, Andrew Thomason:
The structure of hereditary properties and 2-coloured multigraphs. Comb. 31(1): 85-93 (2011) - [j55]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Minors in Graphs with High Chromatic Number. Comb. Probab. Comput. 20(4): 513-518 (2011) - [j54]Klas Markström, Andrew Thomason, Peter Wagner:
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs Comb. 27(2): 243-249 (2011) - 2010
- [j53]Tomasz Luczak, Andrew Thomason:
Vicarious Graphs. Comb. Probab. Comput. 19(5-6): 819-827 (2010) - [j52]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Hadwiger numbers and over-dominating colourings. Discret. Math. 310(20): 2662-2665 (2010) - [j51]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)
2000 – 2009
- 2009
- [j50]Andrew Thomason, Peter Wagner:
Bounding the size of square-free subgraphs of the hypercube. Discret. Math. 309(6): 1730-1735 (2009) - 2008
- [j49]Svante Janson, Andrew Thomason:
Dismantling Sparse Random Graphs. Comb. Probab. Comput. 17(2): 259-264 (2008) - [j48]Andrew Thomason:
Disjoint unions of complete minors. Discret. Math. 308(19): 4370-4377 (2008) - [j47]Penny E. Haxell, Oleg Pikhurko, Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57(2): 149-156 (2008) - 2007
- [j46]Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. Comb. 27(1): 1-12 (2007) - [j45]Andrew Thomason:
Disjoint complete minors and bipartite minors. Eur. J. Comb. 28(6): 1779-1783 (2007) - [j44]Andrew Thomason, Peter Wagner:
Complete graphs with no rainbow path. J. Graph Theory 54(3): 261-266 (2007) - 2006
- [j43]Béla Bollobás, Andrew Thomason:
Set colourings of graphs. Discret. Math. 306(10-11): 948-952 (2006) - 2005
- [j42]Joseph Samuel Myers, Andrew Thomason:
The Extremal Function For Noncomplete Minors. Comb. 25(6): 725-753 (2005) - 2004
- [j41]Andrew Thomason:
Two Minor Problems. Comb. Probab. Comput. 13(3): 412 (2004) - [j40]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 B 90(1): 1 (2004) - [j39]Felix Lazebnik, Andrew Thomason:
Orthomorphisms and the construction of projective planes. Math. Comput. 73(247): 1547-1557 (2004) - 2003
- [j38]Béla Bollobás, Andrew Thomason:
Frank Ramsey. Comb. Probab. Comput. 12(5-6): 469-475 (2003) - 2002
- [j37]Oleg Pikhurko, Andrew Thomason:
Disjoint subgraphs of large maximum degree. Discret. Math. 248(1-3): 125-141 (2002) - 2001
- [j36]Andrew Thomason:
The Extremal Function for Complete Minors. J. Comb. Theory B 81(2): 318-338 (2001) - 2000
- [j35]Béla Bollobás, Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs. Comb. 20(2): 173-202 (2000) - [j34]Andrew Thomason:
Subdivisions, linking, minors, and extremal functions. Electron. Notes Discret. Math. 5: 295-298 (2000) - [j33]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): 66-82 (2000) - [j32]Andrew Thomason:
Complete minors in pseudorandom graphs. Random Struct. Algorithms 17(1): 26-28 (2000)
1990 – 1999
- 1999
- [j31]Béla Bollobás, Andrew Thomason:
Weakly Pancyclic Graphs. J. Comb. Theory B 77(1): 121-137 (1999) - 1998
- [j30]Richard H. Schelp, Andrew Thomason:
A Remark on the Number of Complete and Empty Subgraphs. Comb. Probab. Comput. 7(2): 217-219 (1998) - [j29]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
- [j28]Andrew Thomason:
Graph Products and Monochromatic Multiplicities. Comb. 17(1): 125-134 (1997) - [j27]Béla Bollobás, Andrew Thomason:
On the girth of hamiltonian weakly pancyclic graphs. J. Graph Theory 26(3): 165-173 (1997) - 1996
- [j26]Chris Jagger, Pavel Stovícek, Andrew Thomason:
Multiplicities of Subgraphs. Comb. 16(1): 123-141 (1996) - [j25]Béla Bollobás, Andrew Thomason:
Highly Linked Graphs. Comb. 16(3): 313-320 (1996) - 1995
- [j24]Roland Häggkvist, Andrew Thomason:
Oriented hamilton cycles in digraphs. J. Graph Theory 19(4): 471-479 (1995) - [j23]Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason:
On Key Storage in Secure Networks. J. Cryptol. 8(4): 189-200 (1995) - [j22]Béla Bollobás, Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6(2/3): 353-356 (1995) - 1992
- [j21]Julie Haviland, Andrew Thomason:
On testing the 'pseudo-randomness' of a hypergraph. Discret. Math. 103(3): 321-327 (1992) - [j20]Julie Haviland, Andrew Thomason:
Rotation numers for complete bipartite graphs. J. Graph Theory 16(1): 61-71 (1992) - 1991
- [j19]Roland Häggkvist, Andrew Thomason:
Trees in tournaments. Comb. 11(2): 123-130 (1991) - [j18]Julie Haviland, Andrew Thomason:
Rotation numbers for complete tripartite graphs. Graphs Comb. 7(2): 153-163 (1991) - [c1]Béla Bollobás, Bruce A. Reed, Andrew Thomason:
An extremal function for the achromatic number. Graph Structure Theory 1991: 161-165
1980 – 1989
- 1989
- [j17]Julie Haviland, Andrew Thomason:
Pseudo-random hypergraphs. Discret. Math. 75(1-3): 255-278 (1989) - [j16]Andrew Thomason:
A simple linear expected time algorithm for finding a hamilton path. Discret. Math. 75(1-3): 373-379 (1989) - [j15]Andrew Thomason:
Dense expanders and pseudo-random bipartite graphs. Discret. Math. 75(1-3): 381-386 (1989) - 1988
- [j14]Andrew Thomason:
A Graph Property not Satisfying a 'Zero-One Law'. Eur. J. Comb. 9(6): 517-521 (1988) - [j13]Andrew Thomason:
An upper bound for some ramsey numbers. J. Graph Theory 12(4): 509-517 (1988) - 1987
- [j12]Béla Bollobás, Andrew Thomason:
Threshold functions. Comb. 7(1): 35-38 (1987) - 1983
- [j11]Béla Bollobás, Andrew Thomason:
Parallel sorting. Discret. Appl. Math. 6(1): 1-11 (1983) - 1982
- [j10]Andrew Thomason:
Critically partitionable graphs II. Discret. Math. 41(1): 67-77 (1982) - [j9]Andrew Thomason:
On Finite Ramsey Numbers. Eur. J. Comb. 3(3): 263-273 (1982) - [j8]Ernest J. Cockayne, Andrew G. Thomason:
Ordered colourings of graphs. J. Comb. Theory B 32(3): 286-292 (1982) - [j7]Andrew Thomason:
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. J. Graph Theory 6(2): 219-221 (1982) - 1981
- [j6]Ernest J. Cockayne, Odile Favaron, C. Payan, Andrew G. Thomason:
Contributions to the theory of domination, independence and irredundance in graphs. Discret. Math. 33(3): 249-258 (1981) - [j5]Béla Bollobás, Andrew Thomason:
Graphs which Contain all Small Graphs. Eur. J. Comb. 2(1): 13-15 (1981) - [j4]Béla Bollobás, Andrew Thomason:
Dense neighbourhoods and Turán's theorem. J. Comb. Theory B 31(3): 111-114 (1981)
1970 – 1979
- 1979
- [j3]Béla Bollobás, Andrew Thomason:
Set colourings of graphs. Discret. Math. 25(1): 21-26 (1979) - [j2]Ernest J. Cockayne, Frank Ruskey, Andrew G. Thomason:
An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9(4): 171-175 (1979) - [j1]Andrew G. Thomason:
Critically partitionable graphs, I. J. Comb. Theory B 27(3): 254-259 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
