Graham R. Brightwell

Publication Activity (10 Years)

Years Active: 1988-2017
Publications (10 Years): 2

Top Topics

Learning Curves

Independent Set

Totally Ordered

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

Graham R. Brightwell, Svante Janson, Malwina J. Luczak
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51 (4) (2017)
Graham R. Brightwell, Mitchel T. Keller
The Reversal Ratio of a Poset. Order 32 (1) (2015)
Graham R. Brightwell, Mareike Massow
Diametral Pairs of Linear Extensions. SIAM J. Discret. Math. 27 (2) (2013)
Peter Allen, Graham R. Brightwell, Jozef Skokan
Ramsey-goodness - and otherwise. Comb. 33 (2) (2013)
Graham R. Brightwell, Malwina J. Luczak
Order-Invariant Measures on Fixed Causal Sets. Comb. Probab. Comput. 21 (3) (2012)
Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger
Extremal subgraphs of random graphs. Random Struct. Algorithms 41 (2) (2012)
Béla Bollobás, Graham R. Brightwell, Robert Morris
Shadows of ordered graphs. J. Comb. Theory, Ser. A 118 (3) (2011)
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
Permutation Capacities and Oriented Infinite Paths. Electron. Notes Discret. Math. 38 (2011)
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discret. Math. 24 (2) (2010)
Graham R. Brightwell, Viresh Patel
Average relational distance in linear extensions of posets. Discret. Math. 310 (5) (2010)
Graham R. Brightwell, Nicholas Georgiou
Continuum limits for classical sequential growth models. Random Struct. Algorithms 36 (2) (2010)
Graham R. Brightwell, Peter Winkler
Submodular Percolation. SIAM J. Discret. Math. 23 (3) (2009)
Graham R. Brightwell
Introduction. Comb. Probab. Comput. 18 (5) (2009)
Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger
On extremal subgraphs of random graphs. SODA (2007)
Graham R. Brightwell, Jan van den Heuvel, Leen Stougie
A Linear Bound On The Diameter Of The Transportation Polytope. Comb. 26 (2) (2006)
Béla Bollobás, Graham R. Brightwell
-cliques? J. Graph Theory 52 (2) (2006)
Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
Dominating sets in k-majority tournaments. J. Comb. Theory, Ser. B 96 (3) (2006)
Graham R. Brightwell, Peter Winkler
Counting Eulerian Circuits is #P-Complete. ALENEX/ANALCO (2005)
Graham R. Brightwell, Peter Winkler
A second threshold for the hard-core model on a Bethe lattice. Random Struct. Algorithms 24 (3) (2004)
Graham R. Brightwell, Peter Winkler
Note on Counting Eulerian Circuits CoRR (2004)
Airat Bekmetjev, Graham R. Brightwell, Andrzej Czygrinow, Glenn Hurlbert
Thresholds for families of multisets, with an application to graph pebbling. Discret. Math. 269 (1-3) (2003)
Graham R. Brightwell, Prasad Tetali
The Number of Linear Extensions of the Boolean Lattice. Order 20 (4) (2003)
Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd
Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41 (2) (2003)
Béla Bollobás, Graham R. Brightwell
The number of k-SAT functions. Random Struct. Algorithms 22 (3) (2003)
Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12 (5-6) (2003)
Graham R. Brightwell, William T. Trotter
A combinatorial approach to correlation inequalities. Discret. Math. 257 (2-3) (2002)
Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd
Reserving Resilient Capacity in a Network. SIAM J. Discret. Math. 14 (4) (2001)
Graham R. Brightwell, Peter Winkler
Graph Homomorphisms and Long Range Action. Graphs, Morphisms and Statistical Physics (2001)
Graham R. Brightwell, Peter Winkler
Gibbs Measures and Dismantlable Graphs. J. Comb. Theory, Ser. B 78 (1) (2000)
Graham R. Brightwell, David A. Grable, Hans Jürgen Prömel
Forbidden induced partial orders. Discret. Math. 201 (1-3) (1999)
Graham R. Brightwell, Peter Winkler
Graph Homomorphisms and Phase Transitions. J. Comb. Theory, Ser. B 77 (2) (1999)
Béla Bollobás, Graham R. Brightwell, Alexander F. Sidorenko
Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20 (5) (1999)
Graham R. Brightwell
Balanced pairs in partial orders. Discret. Math. 201 (1-3) (1999)
Graham R. Brightwell, William T. Trotter
The Order Dimension of Planar Maps. SIAM J. Discret. Math. 10 (4) (1997)
Béla Bollobás, Graham R. Brightwell
The Structure of Random Graph Orders. SIAM J. Discret. Math. 10 (2) (1997)
Béla Bollobás, Graham R. Brightwell
Random Walks and Electrical Resistances in Products of Graphs. Discret. Appl. Math. 73 (1) (1997)
Graham R. Brightwell, Claire Kenyon, Hélène Paugam-Moisy
Multilayer Neural Networks: One or Two Hidden Layers? NIPS (1996)
Graham R. Brightwell, Hans Jürgen Prömel, Angelika Steger
The Average Number of Linear Extensions of a Partial Order. J. Comb. Theory, Ser. A 73 (2) (1996)
Martin Anthony, Graham R. Brightwell, John Shawe-Taylor
On Specifying Boolean Functions by Labelled Examples. Discret. Appl. Math. 61 (1) (1995)
Graham R. Brightwell, Edward R. Scheinerman
The dual of a circle order is not necessarilty a circle order. Ars Comb. 41 (1995)
Graham R. Brightwell
Random Graph Orders Do Not Satisfy a 0-1 Law. Random Struct. Algorithms 6 (2/3) (1995)
Martin Anthony, Graham R. Brightwell, Colin Cooper
The vapnik-chervonenkis dimension of a random graph. Discret. Math. 138 (1-3) (1995)
Graham R. Brightwell
Linear extensions of random orders. Discret. Math. 125 (1-3) (1994)
Graham R. Brightwell, William T. Trotter
The Order Dimension of Convex Polytopes. SIAM J. Discret. Math. 6 (2) (1993)
Graham R. Brightwell, Yoshiharu Kohayakawa
Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms 4 (4) (1993)
Graham R. Brightwell, Edward R. Scheinerman
Representations of Planar Graphs. SIAM J. Discret. Math. 6 (2) (1993)
Béla Bollobás, Graham R. Brightwell
Cycles through specified vertices. Comb. 13 (2) (1993)
Graham R. Brightwell, Teunis J. Ott, Peter Winkler
Target Shooting with Programmed Random Variables STOC (1992)
Graham R. Brightwell, Colin Wright
The 1/3-2/3 Conjecture for 5-Thin Posets. SIAM J. Discret. Math. 5 (4) (1992)
Martin Anthony, Graham R. Brightwell, David A. Cohen, John Shawe-Taylor
On Exact Specification by Examples. COLT (1992)
Graham R. Brightwell, Jaroslav Nesetril
Reorientations of covering graphs. Discret. Math. 88 (2-3) (1991)
Graham R. Brightwell, Peter Winkler
Counting Linear Extensions is #P-Complete STOC (1991)
Béla Bollobás, Graham R. Brightwell
Parallel Selection with High Probability. SIAM J. Discret. Math. 3 (1) (1990)
Graham R. Brightwell, Peter Winkler
Extremal cover times for random walks on trees. J. Graph Theory 14 (5) (1990)
Graham R. Brightwell
Events correlated with respect to every subposet of a fixed poset. Graphs Comb. 6 (2) (1990)
Graham R. Brightwell, Peter Winkler
Maximum itting Time for Random Walks on Graphs. Random Struct. Algorithms 1 (3) (1990)
Béla Bollobás, Graham R. Brightwell
Long cycles in graphs with no subgraphs of minimal degree 3. Discret. Math. 75 (1-3) (1989)
Béla Bollobás, Graham R. Brightwell
Transitive Orientations of Graphs. SIAM J. Comput. 17 (6) (1988)
Graham R. Brightwell
Linear extensions of infinite posets. Discret. Math. 70 (2) (1988)