Andrew Thomason

Matthew Wales

J. Graph Theory, 2022

2020

A Lower Bound on the Average Degree Forcing a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

List colorings of multipartite hypergraphs.

[BibT_eX]

[DOI]

Arès Méroueh

Random Struct. Algorithms, 2019

2016

Online containers for hypergraphs, with applications to linear equations.

[BibT_eX]

[DOI]

David Saxton

J. Comb. Theory, Ser. B, 2016

Simple Containers for Simple Hypergraphs.

[BibT_eX]

[DOI]

David Saxton

Comb. Probab. Comput., 2016

2013

On Minimum Saturated Matrices.

[BibT_eX]

[DOI]

Andrzej Dudek

Oleg Pikhurko

Graphs Comb., 2013

Hereditary and Monotone Properties of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

List Colourings of Regular Hypergraphs.

[BibT_eX]

[DOI]

David Saxton

Comb. Probab. Comput., 2012

2011

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.

[BibT_eX]

[DOI]

Klas Markström

Peter Wagner

Graphs Comb., 2011

Minors in Graphs with High Chromatic Number.

[BibT_eX]

[DOI]

Thomas Böhme

Alexandr V. Kostochka

Comb. Probab. Comput., 2011

The structure of hereditary properties and 2-coloured multigraphs.

[BibT_eX]

[DOI]

Edward Marchant

Comb., 2011

2010

Weighted spectral distribution for internet topology analysis: theory and applications.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2010

Hadwiger numbers and over-dominating colourings.

[BibT_eX]

[DOI]

Thomas Böhme

Alexandr V. Kostochka

Discret. Math., 2010

Vicarious Graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Comb. Probab. Comput., 2010

2009

Bounding the size of square-free subgraphs of the hypercube.

[BibT_eX]

[DOI]

Peter Wagner

Discret. Math., 2009

2008

Maximum acyclic and fragmented sets in regular graphs.

[BibT_eX]

[DOI]

Penny E. Haxell

Oleg Pikhurko

J. Graph Theory, 2008

Disjoint unions of complete minors.

[BibT_eX]

[DOI]

Discret. Math., 2008

Dismantling Sparse Random Graphs.

[BibT_eX]

[DOI]

Svante Janson

Comb. Probab. Comput., 2008

2007

Complete graphs with no rainbow path.

[BibT_eX]

[DOI]

Peter Wagner

J. Graph Theory, 2007

Disjoint complete minors and bipartite minors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Vertex-Colouring Edge-Weightings.

[BibT_eX]

[DOI]

Comb., 2007

2006

Set colourings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

The Extremal Function For Noncomplete Minors.

[BibT_eX]

[DOI]

Joseph Samuel Myers

Comb., 2005

2004

Orthomorphisms and the construction of projective planes.

[BibT_eX]

[DOI]

Felix Lazebnik

Math. Comput., 2004

To Adrian Bondy and U. S. R. Murty.

[BibT_eX]

[DOI]

William H. Cunningham

J. Comb. Theory, Ser. B, 2004

Two Minor Problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

2003

Frank Ramsey.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Disjoint subgraphs of large maximum degree.

[BibT_eX]

[DOI]

Oleg Pikhurko

Discret. Math., 2002

2001

The Extremal Function for Complete Minors.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2001

2000

Complete minors in pseudorandom graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs.

[BibT_eX]

[DOI]

Richard H. Schelp

J. Graph Theory, 2000

Subdivisions, linking, minors, and extremal functions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

The Structure of Hereditary Properties and Colourings of Random Graphs.

[BibT_eX]

[DOI]

Comb., 2000

1999

Weakly Pancyclic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1999

1998

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

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

A Remark on the Number of Complete and Empty Subgraphs.

[BibT_eX]

[DOI]

Richard H. Schelp

Comb. Probab. Comput., 1998

1997

On the girth of hamiltonian weakly pancyclic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Graph Products and Monochromatic Multiplicities.

[BibT_eX]

[DOI]

Comb., 1997

1996

Multiplicities of Subgraphs.

[BibT_eX]

[DOI]

Chris Jagger

Pavel Stovícek

Comb., 1996

Highly Linked Graphs.

[BibT_eX]

[DOI]

Comb., 1996

1995

Generalized Chromatic Numbers of Random Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

On Key Storage in Secure Networks.

[BibT_eX]

[DOI]

J. Cryptol., 1995

Oriented hamilton cycles in digraphs.

[BibT_eX]

[DOI]

Roland Häggkvist

J. Graph Theory, 1995

1992

Rotation numers for complete bipartite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

On testing the 'pseudo-randomness' of a hypergraph.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Rotation numbers for complete tripartite graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1991

Trees in tournaments.

[BibT_eX]

[DOI]

Roland Häggkvist

Comb., 1991

An extremal function for the achromatic number.

[BibT_eX]

Bruce A. Reed

Proceedings of the Graph Structure Theory, 1991

1989

Dense expanders and pseudo-random bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

A simple linear expected time algorithm for finding a hamilton path.

[BibT_eX]

[DOI]

Discret. Math., 1989

Pseudo-random hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

An upper bound for some ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

A Graph Property not Satisfying a 'Zero-One Law'.

[BibT_eX]

[DOI]

Eur. J. Comb., 1988

1987

Threshold functions.

[BibT_eX]

[DOI]

Comb., 1987

1983

Parallel sorting.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

Ordered colourings of graphs.

[BibT_eX]

[DOI]

Ernest J. Cockayne

Andrew G. Thomason

J. Comb. Theory, Ser. B, 1982

On Finite Ramsey Numbers.

[BibT_eX]

[DOI]

Eur. J. Comb., 1982

Critically partitionable graphs II.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

Dense neighbourhoods and Turán's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1981

Graphs which Contain all Small Graphs.

[BibT_eX]

[DOI]