Graham R. Brightwell

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