Graham R. Brightwell

According to our database1, Graham R. Brightwell authored at least 60 papers between 1988 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





The Greedy Independent Set in a Random Graph with Given Degrees.
Random Struct. Algorithms, 2017

The Reversal Ratio of a Poset.
Order, 2015

Diametral Pairs of Linear Extensions.
SIAM J. Discret. Math., 2013

Ramsey-goodness - and otherwise.
Comb., 2013

The Dimension of Random Graph Orders.
Proceedings of the Mathematics of Paul Erdős II, 2013

Extremal subgraphs of random graphs.
Random Struct. Algorithms, 2012

Order-Invariant Measures on Fixed Causal Sets.
Comb. Probab. Comput., 2012

Shadows of ordered graphs.
J. Comb. Theory, Ser. A, 2011

Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math., 2011

Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discret. Math., 2010

Continuum limits for classical sequential growth models.
Random Struct. Algorithms, 2010

Average relational distance in linear extensions of posets.
Discret. Math., 2010

Submodular Percolation.
SIAM J. Discret. Math., 2009

Comb. Probab. Comput., 2009

How many graphs are unions of <i>k</i>-cliques?
Journal of Graph Theory, 2006

Dominating sets in k-majority tournaments.
J. Comb. Theory, Ser. B, 2006

A Linear Bound On The Diameter Of The Transportation Polytope.
Comb., 2006

Counting Eulerian Circuits is #P-Complete.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

A second threshold for the hard-core model on a Bethe lattice.
Random Struct. Algorithms, 2004

Note on Counting Eulerian Circuits
CoRR, 2004

The number of k-SAT functions.
Random Struct. Algorithms, 2003

The Number of Linear Extensions of the Boolean Lattice.
Order, 2003

Reserving resilient capacity for a single commodity with upper-bound constraints.
Networks, 2003

Thresholds for families of multisets, with an application to graph pebbling.
Discret. Math., 2003

Special Issue on Ramsey Theory.
Comb. Probab. Comput., 2003

A combinatorial approach to correlation inequalities.
Discret. Math., 2002

Reserving Resilient Capacity in a Network.
SIAM J. Discret. Math., 2001

Graph Homomorphisms and Long Range Action.
Proceedings of the Graphs, 2001

Gibbs Measures and Dismantlable Graphs.
J. Comb. Theory, Ser. B, 2000

Partially Ordered Sets.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Graph Homomorphisms and Phase Transitions.
J. Comb. Theory, Ser. B, 1999

Geometrical Techniques for Estimating Numbers of Linear Extensions.
Eur. J. Comb., 1999

Forbidden induced partial orders.
Discret. Math., 1999

Balanced pairs in partial orders.
Discret. Math., 1999

The Order Dimension of Planar Maps.
SIAM J. Discret. Math., 1997

The Structure of Random Graph Orders.
SIAM J. Discret. Math., 1997

Random Walks and Electrical Resistances in Products of Graphs.
Discret. Appl. Math., 1997

The Average Number of Linear Extensions of a Partial Order.
J. Comb. Theory, Ser. A, 1996

Multilayer Neural Networks: One or Two Hidden Layers?
Proceedings of the Advances in Neural Information Processing Systems 9, 1996

Random Graph Orders Do Not Satisfy a 0-1 Law.
Random Struct. Algorithms, 1995

The vapnik-chervonenkis dimension of a random graph.
Discret. Math., 1995

On Specifying Boolean Functions by Labelled Examples.
Discret. Appl. Math., 1995

The dual of a circle order is not necessarilty a circle order.
Ars Comb., 1995

Linear extensions of random orders.
Discret. Math., 1994

The Order Dimension of Convex Polytopes.
SIAM J. Discret. Math., 1993

Representations of Planar Graphs.
SIAM J. Discret. Math., 1993

Ramsey Properties of Orientations of Graphs.
Random Struct. Algorithms, 1993

Cycles through specified vertices.
Comb., 1993

The 1/3-2/3 Conjecture for 5-Thin Posets.
SIAM J. Discret. Math., 1992

Target Shooting with Programmed Random Variables
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On Exact Specification by Examples.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Reorientations of covering graphs.
Discret. Math., 1991

Counting Linear Extensions is #P-Complete
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Parallel Selection with High Probability.
SIAM J. Discret. Math., 1990

Maximum itting Time for Random Walks on Graphs.
Random Struct. Algorithms, 1990

Extremal cover times for random walks on trees.
Journal of Graph Theory, 1990

Events correlated with respect to every subposet of a fixed poset.
Graphs Comb., 1990

Long cycles in graphs with no subgraphs of minimal degree 3.
Discret. Math., 1989

Transitive Orientations of Graphs.
SIAM J. Comput., 1988

Linear extensions of infinite posets.
Discret. Math., 1988