Linear extensions of infinite posets. - Graham R. Brightwell (Discret. Math., 1988)

Transitive Orientations of Graphs. - Béla Bollobás; Graham R. Brightwell (SIAM J. Comput., 1988)

Long cycles in graphs with no subgraphs of minimal degree 3. - Béla Bollobás; Graham R. Brightwell (Discret. Math., 1989)

Events correlated with respect to every subposet of a fixed poset. - Graham R. Brightwell (Graphs Comb., 1990)

Extremal cover times for random walks on trees. - Graham R. Brightwell; Peter Winkler 001 (J. Graph Theory, 1990)

Maximum itting Time for Random Walks on Graphs. - Graham R. Brightwell; Peter Winkler 001 (Random Struct. Algorithms, 1990)

Parallel Selection with High Probability. - Béla Bollobás; Graham R. Brightwell (SIAM J. Discret. Math., 1990)

Counting Linear Extensions is #P-Complete - Graham R. Brightwell; Peter Winkler 001 (STOC, 1991)

Reorientations of covering graphs. - Graham R. Brightwell; Jaroslav Nesetril (Discret. Math., 1991)

On Exact Specification by Examples. - Martin Anthony; Graham R. Brightwell; David A. Cohen; John Shawe-Taylor (COLT, 1992)

Target Shooting with Programmed Random Variables - Graham R. Brightwell; Teunis J. Ott; Peter Winkler 001 (STOC, 1992)

The 1/3-2/3 Conjecture for 5-Thin Posets. - Graham R. Brightwell; Colin Wright (SIAM J. Discret. Math., 1992)

Cycles through specified vertices. - Béla Bollobás; Graham R. Brightwell (Comb., 1993)

Ramsey Properties of Orientations of Graphs. - Graham R. Brightwell; Yoshiharu Kohayakawa (Random Struct. Algorithms, 1993)

Representations of Planar Graphs. - Graham R. Brightwell; Edward R. Scheinerman (SIAM J. Discret. Math., 1993)

The Order Dimension of Convex Polytopes. - Graham R. Brightwell; William T. Trotter (SIAM J. Discret. Math., 1993)

Linear extensions of random orders. - Graham R. Brightwell (Discret. Math., 1994)

The dual of a circle order is not necessarilty a circle order. - Graham R. Brightwell; Edward R. Scheinerman (Ars Comb., 1995)

On Specifying Boolean Functions by Labelled Examples. - Martin Anthony; Graham R. Brightwell; John Shawe-Taylor (Discret. Appl. Math., 1995)

The vapnik-chervonenkis dimension of a random graph. - Martin Anthony; Graham R. Brightwell; Colin Cooper (Discret. Math., 1995)

Random Graph Orders Do Not Satisfy a 0-1 Law. - Graham R. Brightwell (Random Struct. Algorithms, 1995)

Multilayer Neural Networks: One or Two Hidden Layers? - Graham R. Brightwell; Claire Kenyon; Hélène Paugam-Moisy (NIPS, 1996)

The Average Number of Linear Extensions of a Partial Order. - Graham R. Brightwell; Hans Jürgen Prömel; Angelika Steger (J. Comb. Theory A, 1996)

Random Walks and Electrical Resistances in Products of Graphs. - Béla Bollobás; Graham R. Brightwell (Discret. Appl. Math., 1997)

The Structure of Random Graph Orders. - Béla Bollobás; Graham R. Brightwell (SIAM J. Discret. Math., 1997)

The Order Dimension of Planar Maps. - Graham R. Brightwell; William T. Trotter (SIAM J. Discret. Math., 1997)

Balanced pairs in partial orders. - Graham R. Brightwell (Discret. Math., 1999)

Forbidden induced partial orders. - Graham R. Brightwell; David A. Grable; Hans Jürgen Prömel (Discret. Math., 1999)

Geometrical Techniques for Estimating Numbers of Linear Extensions. - Béla Bollobás; Graham R. Brightwell; Alexander F. Sidorenko (Eur. J. Comb., 1999)

Graph Homomorphisms and Phase Transitions. - Graham R. Brightwell; Peter Winkler 001 (J. Comb. Theory B, 1999)

Partially Ordered Sets. - Graham R. Brightwell; Douglas B. West (Handbook of Discrete and Combinatorial Mathematics, 1999)

Gibbs Measures and Dismantlable Graphs. - Graham R. Brightwell; Peter Winkler 001 (J. Comb. Theory B, 2000)

Graph Homomorphisms and Long Range Action. - Graham R. Brightwell; Peter Winkler 001 (Graphs, Morphisms and Statistical Physics, 2001)

Reserving Resilient Capacity in a Network. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (SIAM J. Discret. Math., 2001)

A combinatorial approach to correlation inequalities. - Graham R. Brightwell; William T. Trotter (Discret. Math., 2002)

Special Issue on Ramsey Theory. - Béla Bollobás; Graham R. Brightwell; Yoshiharu Kohayakawa; Imre Leader; Alex D. Scott (Comb. Probab. Comput., 2003)

Thresholds for families of multisets, with an application to graph pebbling. - Airat Bekmetjev; Graham R. Brightwell; Andrzej Czygrinow; Glenn Hurlbert (Discret. Math., 2003)

Reserving resilient capacity for a single commodity with upper-bound constraints. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (Networks, 2003)

The Number of Linear Extensions of the Boolean Lattice. - Graham R. Brightwell; Prasad Tetali (Order, 2003)

The number of k-SAT functions. - Béla Bollobás; Graham R. Brightwell (Random Struct. Algorithms, 2003)

Note on Counting Eulerian Circuits - Graham R. Brightwell; Peter Winkler 001 (CoRR, 2004)

A second threshold for the hard-core model on a Bethe lattice. - Graham R. Brightwell; Peter Winkler 001 (Random Struct. Algorithms, 2004)

Counting Eulerian Circuits is #P-Complete. - Graham R. Brightwell; Peter Winkler 001 (ALENEX/ANALCO, 2005)

A Linear Bound On The Diameter Of The Transportation Polytope. - Graham R. Brightwell; Jan van den Heuvel; Leen Stougie (Comb., 2006)

Dominating sets in k-majority tournaments. - Noga Alon; Graham R. Brightwell; Hal A. Kierstead; Alexandr V. Kostochka; Peter Winkler 001 (J. Comb. Theory B, 2006)

How many graphs are unions of k-cliques? - Béla Bollobás; Graham R. Brightwell (J. Graph Theory, 2006)

Introduction. - Graham R. Brightwell (Comb. Probab. Comput., 2009)

Submodular Percolation. - Graham R. Brightwell; Peter Winkler 001 (SIAM J. Discret. Math., 2009)

Average relational distance in linear extensions of posets. - Graham R. Brightwell; Viresh Patel (Discret. Math., 2010)

Continuum limits for classical sequential growth models. - Graham R. Brightwell; Nicholas Georgiou (Random Struct. Algorithms, 2010)

Permutation Capacities of Families of Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (SIAM J. Discret. Math., 2010)

Permutation Capacities and Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (Electron. Notes Discret. Math., 2011)

Shadows of ordered graphs. - Béla Bollobás; Graham R. Brightwell; Robert Morris 001 (J. Comb. Theory A, 2011)

Order-Invariant Measures on Fixed Causal Sets. - Graham R. Brightwell; Malwina J. Luczak (Comb. Probab. Comput., 2012)

Extremal subgraphs of random graphs. - Graham R. Brightwell; Konstantinos Panagiotou; Angelika Steger (Random Struct. Algorithms, 2012)

The Dimension of Random Graph Orders. - Béla Bollobás; Graham R. Brightwell (The Mathematics of Paul Erdős II, 2013)

Ramsey-goodness - and otherwise. - Peter Allen 001; Graham R. Brightwell; Jozef Skokan (Comb., 2013)

Diametral Pairs of Linear Extensions. - Graham R. Brightwell; Mareike Massow (SIAM J. Discret. Math., 2013)

The Reversal Ratio of a Poset. - Graham R. Brightwell; Mitchel T. Keller (Order, 2015)

The Greedy Independent Set in a Random Graph with Given Degrees. - Graham R. Brightwell; Svante Janson; Malwina J. Luczak (Random Struct. Algorithms, 2017)