default search action
Graham R. Brightwell
Person information
- affiliation: London School of Economics, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j51]Graham R. Brightwell, Svante Janson, Malwina J. Luczak
:
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51(4): 565-586 (2017) - 2015
- [j50]Graham R. Brightwell, Mitchel T. Keller:
The Reversal Ratio of a Poset. Order 32(1): 43-52 (2015) - 2013
- [j49]Peter Allen, Graham R. Brightwell, Jozef Skokan
Ramsey-goodness - and otherwise. Comb. 33(2): 125-160 (2013) - [j48]Graham R. Brightwell, Mareike Massow:
Diametral Pairs of Linear Extensions. SIAM J. Discret. Math. 27(2): 634-649 (2013) - [p1]Béla Bollobás, Graham R. Brightwell:
The Dimension of Random Graph Orders. The Mathematics of Paul Erdős II 2013: 47-68 - 2012
- [j47]Graham R. Brightwell, Malwina J. Luczak
Order-Invariant Measures on Fixed Causal Sets. Comb. Probab. Comput. 21(3): 330-357 (2012) - [j46]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
Extremal subgraphs of random graphs. Random Struct. Algorithms 41(2): 147-178 (2012) - 2011
- [j45]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: 195-199 (2011) - [j44]Béla Bollobás, Graham R. Brightwell, Robert Morris:
Shadows of ordered graphs. J. Comb. Theory A 118(3): 729-747 (2011) - 2010
- [j43]Graham R. Brightwell, Viresh Patel:
Average relational distance in linear extensions of posets. Discret. Math. 310(5): 1016-1021 (2010) - [j42]Graham R. Brightwell, Nicholas Georgiou:
Continuum limits for classical sequential growth models. Random Struct. Algorithms 36(2): 218-250 (2010) - [j41]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): 441-456 (2010)
2000 – 2009
- 2009
- [j40]Graham R. Brightwell:
Introduction. Comb. Probab. Comput. 18(5): 617-618 (2009) - [j39]Graham R. Brightwell, Peter Winkler
Submodular Percolation. SIAM J. Discret. Math. 23(3): 1149-1178 (2009) - 2007
- [c7]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
On extremal subgraphs of random graphs. SODA 2007: 477-485 - 2006
- [j38]Graham R. Brightwell, Jan van den Heuvel
A Linear Bound On The Diameter Of The Transportation Polytope. Comb. 26(2): 133-139 (2006) - [j37]Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
Dominating sets in k-majority tournaments. J. Comb. Theory B 96(3): 374-387 (2006) - [j36]Béla Bollobás, Graham R. Brightwell:
How many graphs are unions of k-cliques? J. Graph Theory 52(2): 87-107 (2006) - 2005
- [c6]Graham R. Brightwell, Peter Winkler:
Counting Eulerian Circuits is #P-Complete. ALENEX/ANALCO 2005: 259-262 - 2004
- [j35]Graham R. Brightwell, Peter Winkler
A second threshold for the hard-core model on a Bethe lattice. Random Struct. Algorithms 24(3): 303-314 (2004) - [i1]Graham R. Brightwell, Peter Winkler:
Note on Counting Eulerian Circuits. CoRR cs.CC/0405067 (2004) - 2003
- [j34]Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12(5-6): 467-468 (2003) - [j33]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): 21-34 (2003) - [j32]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003) - [j31]Graham R. Brightwell, Prasad Tetali:
The Number of Linear Extensions of the Boolean Lattice. Order 20(4): 333-345 (2003) - [j30]Béla Bollobás, Graham R. Brightwell:
The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003) - 2002
- [j29]Graham R. Brightwell, William T. Trotter:
A combinatorial approach to correlation inequalities. Discret. Math. 257(2-3): 311-327 (2002) - 2001
- [j28]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving Resilient Capacity in a Network. SIAM J. Discret. Math. 14(4): 524-539 (2001) - [c5]Graham R. Brightwell, Peter Winkler:
Graph Homomorphisms and Long Range Action. Graphs, Morphisms and Statistical Physics 2001: 29-47 - 2000
- [j27]Graham R. Brightwell, Peter Winkler
Gibbs Measures and Dismantlable Graphs. J. Comb. Theory B 78(1): 141-166 (2000)
1990 – 1999
- 1999
- [j26]Graham R. Brightwell:
Balanced pairs in partial orders. Discret. Math. 201(1-3): 25-52 (1999) - [j25]Graham R. Brightwell, David A. Grable, Hans Jürgen Prömel:
Forbidden induced partial orders. Discret. Math. 201(1-3): 53-80 (1999) - [j24]Béla Bollobás, Graham R. Brightwell, Alexander F. Sidorenko:
Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999) - [j23]Graham R. Brightwell, Peter Winkler
Graph Homomorphisms and Phase Transitions. J. Comb. Theory B 77(2): 221-262 (1999) - [r1]Graham R. Brightwell, Douglas B. West:
Partially Ordered Sets. Handbook of Discrete and Combinatorial Mathematics 1999 - 1997
- [j22]Béla Bollobás, Graham R. Brightwell:
Random Walks and Electrical Resistances in Products of Graphs. Discret. Appl. Math. 73(1): 69-79 (1997) - [j21]Béla Bollobás, Graham R. Brightwell:
The Structure of Random Graph Orders. SIAM J. Discret. Math. 10(2): 318-335 (1997) - [j20]Graham R. Brightwell, William T. Trotter:
The Order Dimension of Planar Maps. SIAM J. Discret. Math. 10(4): 515-528 (1997) - 1996
- [j19]Graham R. Brightwell, Hans Jürgen Prömel, Angelika Steger:
The Average Number of Linear Extensions of a Partial Order. J. Comb. Theory A 73(2): 193-206 (1996) - [c4]Graham R. Brightwell, Claire Kenyon, Hélène Paugam-Moisy:
Multilayer Neural Networks: One or Two Hidden Layers? NIPS 1996: 148-154 - 1995
- [j18]Graham R. Brightwell, Edward R. Scheinerman:
The dual of a circle order is not necessarilty a circle order. Ars Comb. 41 (1995) - [j17]Martin Anthony
On Specifying Boolean Functions by Labelled Examples. Discret. Appl. Math. 61(1): 1-25 (1995) - [j16]Martin Anthony
The vapnik-chervonenkis dimension of a random graph. Discret. Math. 138(1-3): 43-56 (1995) - [j15]Graham R. Brightwell:
Random Graph Orders Do Not Satisfy a 0-1 Law. Random Struct. Algorithms 6(2/3): 231-238 (1995) - 1994
- [j14]Graham R. Brightwell:
Linear extensions of random orders. Discret. Math. 125(1-3): 87-96 (1994) - 1993
- [j13]Béla Bollobás, Graham R. Brightwell:
Cycles through specified vertices. Comb. 13(2): 147-155 (1993) - [j12]Graham R. Brightwell, Yoshiharu Kohayakawa
Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms 4(4): 413-428 (1993) - [j11]Graham R. Brightwell, Edward R. Scheinerman:
Representations of Planar Graphs. SIAM J. Discret. Math. 6(2): 214-229 (1993) - [j10]Graham R. Brightwell, William T. Trotter:
The Order Dimension of Convex Polytopes. SIAM J. Discret. Math. 6(2): 230-245 (1993) - 1992
- [j9]Graham R. Brightwell, Colin Wright:
The 1/3-2/3 Conjecture for 5-Thin Posets. SIAM J. Discret. Math. 5(4): 467-474 (1992) - [c3]Martin Anthony
On Exact Specification by Examples. COLT 1992: 311-318 - [c2]Graham R. Brightwell, Teunis J. Ott, Peter Winkler:
Target Shooting with Programmed Random Variables. STOC 1992: 691-698 - 1991
- [j8]Graham R. Brightwell, Jaroslav Nesetril
Reorientations of covering graphs. Discret. Math. 88(2-3): 129-132 (1991) - [c1]Graham R. Brightwell, Peter Winkler:
Counting Linear Extensions is #P-Complete. STOC 1991: 175-181 - 1990
- [j7]Graham R. Brightwell:
Events correlated with respect to every subposet of a fixed poset. Graphs Comb. 6(2): 111-131 (1990) - [j6]Graham R. Brightwell, Peter Winkler:
Extremal cover times for random walks on trees. J. Graph Theory 14(5): 547-554 (1990) - [j5]Graham R. Brightwell, Peter Winkler:
Maximum itting Time for Random Walks on Graphs. Random Struct. Algorithms 1(3): 263-276 (1990) - [j4]Béla Bollobás, Graham R. Brightwell:
Parallel Selection with High Probability. SIAM J. Discret. Math. 3(1): 21-31 (1990)
1980 – 1989
- 1989
- [j3]Béla Bollobás, Graham R. Brightwell:
Long cycles in graphs with no subgraphs of minimal degree 3. Discret. Math. 75(1-3): 47-53 (1989) - 1988
- [j2]Graham R. Brightwell:
Linear extensions of infinite posets. Discret. Math. 70(2): 113-136 (1988) - [j1]Béla Bollobás, Graham R. Brightwell:
Transitive Orientations of Graphs. SIAM J. Comput. 17(6): 1119-1133 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: