Graham R. Brightwell
According to our database^{1},
Graham R. Brightwell
authored at least 60 papers
between 1988 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at viaf.org

at id.loc.gov

at andrej.com
On csauthors.net:
Bibliography
2017
The Greedy Independent Set in a Random Graph with Given Degrees.
Random Struct. Algorithms, 2017
2015
The Reversal Ratio of a Poset.
Order, 2015
2013
Diametral Pairs of Linear Extensions.
SIAM J. Discrete Math., 2013
Ramseygoodness  and otherwise.
Combinatorica, 2013
The Dimension of Random Graph Orders.
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Extremal subgraphs of random graphs.
Random Struct. Algorithms, 2012
OrderInvariant Measures on Fixed Causal Sets.
Combinatorics, Probability & Computing, 2012
2011
Shadows of ordered graphs.
J. Comb. Theory, Ser. A, 2011
Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math., 2011
2010
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discrete Math., 2010
Continuum limits for classical sequential growth models.
Random Struct. Algorithms, 2010
Average relational distance in linear extensions of posets.
Discret. Math., 2010
2009
Submodular Percolation.
SIAM J. Discrete Math., 2009
Introduction.
Combinatorics, Probability & Computing, 2009
2006
How many graphs are unions of kcliques?
Journal of Graph Theory, 2006
Dominating sets in kmajority tournaments.
J. Comb. Theory, Ser. B, 2006
A Linear Bound On The Diameter Of The Transportation Polytope.
Combinatorica, 2006
2005
Counting Eulerian Circuits is #PComplete.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
A second threshold for the hardcore model on a Bethe lattice.
Random Struct. Algorithms, 2004
Note on Counting Eulerian Circuits
CoRR, 2004
2003
The number of kSAT functions.
Random Struct. Algorithms, 2003
The Number of Linear Extensions of the Boolean Lattice.
Order, 2003
Reserving resilient capacity for a single commodity with upperbound constraints.
Networks, 2003
Thresholds for families of multisets, with an application to graph pebbling.
Discret. Math., 2003
Special Issue on Ramsey Theory.
Combinatorics, Probability & Computing, 2003
2002
A combinatorial approach to correlation inequalities.
Discret. Math., 2002
2001
Reserving Resilient Capacity in a Network.
SIAM J. Discrete Math., 2001
Graph Homomorphisms and Long Range Action.
Proceedings of the Graphs, 2001
2000
Gibbs Measures and Dismantlable Graphs.
J. Comb. Theory, Ser. B, 2000
1999
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
1997
The Order Dimension of Planar Maps.
SIAM J. Discrete Math., 1997
The Structure of Random Graph Orders.
SIAM J. Discrete Math., 1997
Random Walks and Electrical Resistances in Products of Graphs.
Discret. Appl. Math., 1997
1996
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
1995
Random Graph Orders Do Not Satisfy a 01 Law.
Random Struct. Algorithms, 1995
The vapnikchervonenkis 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
1994
Linear extensions of random orders.
Discret. Math., 1994
1993
The Order Dimension of Convex Polytopes.
SIAM J. Discrete Math., 1993
Representations of Planar Graphs.
SIAM J. Discrete Math., 1993
Ramsey Properties of Orientations of Graphs.
Random Struct. Algorithms, 1993
Cycles through specified vertices.
Combinatorica, 1993
1992
The 1/32/3 Conjecture for 5Thin Posets.
SIAM J. Discrete 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
1991
Reorientations of covering graphs.
Discret. Math., 1991
Counting Linear Extensions is #PComplete
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
1990
Parallel Selection with High Probability.
SIAM J. Discrete 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 and Combinatorics, 1990
1989
Long cycles in graphs with no subgraphs of minimal degree 3.
Discret. Math., 1989
1988
Transitive Orientations of Graphs.
SIAM J. Comput., 1988
Linear extensions of infinite posets.
Discret. Math., 1988