"Brightwell, Graham"

Article

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2012) Extremal subgraphs of random graphs. Random structures & algorithms, 41 (2). pp. 147-178. ISSN 1042-9832

Brightwell, Graham and Luczak, Malwina J. (2012) Order-invariant measures on fixed causal sets. Combinatorics, probability and computing, 21 (03). pp. 330-357. ISSN 0963-5483

Brightwell, Graham and Luczak, Malwina J. (2012) Vertices of high degree in the preferential attachment tree. Electronic journal of probability, 17 . pp. 1-43. ISSN 1083-6489

Brightwell, Graham, Cohen, Gérard, Fachini, Emanuela, Fairthorne, Marianne, Körner, János, Simonyi, Gábor and Tóth, Ágnes (2011) Permutation capacities and oriented infinite paths. Electronic notes in discrete mathematics, 38 . pp. 195-199. ISSN 1571-0653

Bollobás, Bela, Brightwell, Graham and Morris, Robert (2011) Shadows of ordered graphs. Journal of combinatorial theory, series A, 118 (3). pp. 729-747. ISSN 0097-3165

Brightwell, Graham and Luczak, Malwina J. (2011) Order-invariant measures on causal sets. Annals of applied probability, 21 (4). pp. 1493-1536. ISSN 1050-5164

Brightwell, Graham and Patel, Viresh (2010) Average relational distance in linear extensions of posets. Discrete mathematics, 310 (5). pp. 1016-1021. ISSN 0012-365X

Brightwell, Graham and Georgiou, Nicholas (2010) Continuum limits for classical sequential growth models. Random structures and algorithms, 36 (2). pp. 218-250. ISSN 1042-9832

Brightwell, Graham, Cohen, Gerard, Toth, Agnes, Fairthorne, Marianne, Fachini, Emanuela, Koerner, Janos and Simonyi, Gabor (2010) Permutation capacities of families of oriented infinite paths. SIAM journal on discrete mathematics, 24 (2). pp. 441-456. ISSN 0895-4801

Brightwell, Graham and Winkler, Peter (2009) Submodular percolation. SIAM journal on discrete mathematics, 23 (3). pp. 1149-1178. ISSN 0895-4801

Brightwell, Graham (2009) A result in 2d causal set theory: the emergence of spacetime. Journal of physics: conference series, 174 (012049). pp. 1-6. ISSN 1742-6596

Brightwell, Graham, Henson, Joe and Surya, Sumati (2008) A 2D model of causal set quantum gravity: the emergence of the continuum. Classical and quantum gravity, 25 (10). p. 105025. ISSN 0264-9381

Brightwell, Graham, Alon, Nogo, Kierstead, H. A, Kostochka, A. V and Winkler, P (2006) Dominating sets in k-majority tournaments. Journal of combinatorial theory - series b, 96 (3). pp. 374-387. ISSN 0095-8956

Brightwell, Graham and Bollobás, Bela (2006) How many graphs are unions of k-cliques? Journal of graph theory, 52 (2). pp. 87-107. ISSN 0364-9024

van den Heuvel, Jan, Brightwell, Graham and Stougie, Leen (2006) A linear bound on the diameter of the transportation polytope. Combinatorica, 26 (2). pp. 133-139. ISSN 0209-9683

Brightwell, Graham and Winkler, P. (2004) A second threshold for the hard-core model on a Bethe lattice. Random structures and algorithms, 24 (3). pp. 303-314. ISSN 1098-2418

Brightwell, Graham R. and Tetali, Prasad (2003) The number of linear extensions of the Boolean lattice. Order - a journal on the theory of ordered sets and its applications, 20 (4). pp. 333-345. ISSN 0167-8094

Bekmetjev, Airat, Brightwell, Graham, Czygrinow, Andrzej and Hurlbert, Glenn (2003) Thresholds for families of multisets, with an application to graph pebbling. Discrete mathematics, 269 (1-3). pp. 21-34. ISSN 0012-365X

Bollobás, Bela and Brightwell, Graham R. (2003) The number of k-SAT functions. Random structures and algorithms, 22 (3). pp. 227-247. ISSN 1042-9832

Brightwell, Graham R., Dowker, Fay, Garciá, Raquel S., Henson, Joe and Sorkin, Rafael D. (2003) "Observables" in causal set cosmology. Physical review D, 67 (8). Art. no. 084031. ISSN 1550-7998

Brightwell, Graham R., Oriolo, G. and Shepherd, F. B. (2003) Reserving resilient capacity for a single commodity with upper-bound constraints. Networks, 41 (2). pp. 87-96. ISSN 0028-3045

Bollobás, Bela, Brightwell, Graham R. and Leader, I. (2003) The number of 2-SAT functions. Israel journal of mathematics, 133 . pp. 45-60. ISSN 0021-2172

Brightwell, Graham and Trotter, William T. (2002) A combinatorial approach to correlation inequalities. Discrete mathematics, 257 (2-3). pp. 311-327. ISSN 0012-365X

Brightwell, Graham and Katona, Gyula (2001) A new type of coding problem. Studia scientiarum mathematicarum hungarica, 38 (1-4). pp. 139-147. ISSN 0081-6906

Brightwell, Graham, Oriolo, G. and Shepherd, F. B. (2001) Reserving Resilient Capacity in a Network. SIAM journal on discrete mathematics, 14 (4). pp. 524-539. ISSN 0895-4801

Bollobás, Bela and Brightwell, Graham (2000) Convex bodies, graphs and partial orders. Proceedings of the London mathematical society, 80 (2). pp. 415-450. ISSN 0024-6115

Brightwell, Graham R. and Winkler, Peter (2000) Gibbs measures and dismantlable graphs. Journal of combinatorial theory, series B, 78 (1). pp. 141-166. ISSN 0095-8956

Brightwell, Graham and Winkler, P. (1999) Graph homomorphisms and phase transitions. Journal of combinatorial theory, series B, 77 (2). pp. 221-262. ISSN 0095-8956

Brightwell, Graham, Bollobás, Béla and Sidorenko, Alexander (1999) Geometrical techniques for estimating numbers of linear extensions. European journal of combinatorics, 20 (5). pp. 329-335. ISSN 0195-6698

Brightwell, Graham, Grable, D. A. and Prömel, H. J. (1999) Forbidden induced partial orders. Discrete mathematics, 201 (1-3). pp. 53-80. ISSN 0012-365X

Brightwell, Graham, Haggström, O. and Winkler, P. (1999) Nonmonotonic behavior in hard-core and Widom-Rowlinson models. Journal of statistical physics, 94 (3-4). pp. 415-435. ISSN 0022-4715

Brightwell, Graham (1999) Balanced pairs in partial orders. Discrete mathematics, 201 (1-3). pp. 25-52. ISSN 0012-365X

Book Section

Brightwell, Graham (2007) On external subgraphs of a random graph. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Association for Computing Machinery and Society for Industrial and Applied Mathematics, New York; Philadelphia, USA, pp. 477-485. ISBN 9780898716245

Brightwell, Graham and Winkler, Peter (2004) Graph homomorphisms and long range action. In: Nešetril, Jaroslav and Winkler, Peter, (eds.) Graphs, Morphisms and Statistical Physics. DIMACS Series in Discrete Mathematics and Computer Science,63 . American Mathematical Society, Providence, Rhode Island, USA, pp. 29-48. ISBN 0821835513

Brightwell, Graham and Winkler, Peter (2002) Hard constraints and the Bethe Lattice: adventures at the interface of combinatorics and statistical physics. In: Proceedings of the International Congress of Mathematicians: Beijing 2002, August 20-28 (International Congress of Mathematicians//Proceedings). Higher Education Pr, pp. 605-624. ISBN 9787040086904

Brightwell, Graham and Winkler, Peter (2002) Random colorings of a cayley tree. In: Bollobás, Bela, (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies,Vol. 1 . Springer, U.K., pp. 247-276. ISBN 9783540427254

Brightwell, Graham and West, Douglas (2000) Partially ordered sets. In: Rosen, Kenneth H, (ed.) Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton, Florida, U.S., pp. 717-752. ISBN 9780849301490

Monograph

Allen, Peter, Brightwell, Graham and Skokan, Jozef (2010) Ramsey-goodness -- and otherwise. arXiv.org.

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2009) Extremal subgraphs of random graphs: an extended version. arXiv.

Brightwell, Graham and Luczak, Malwina (2009) Order-invariant measures on fixed causal sets. arXiv.

Bollobas, Bela, Brightwell, Graham and Morris, Robert (2009) Shadows of ordered graphs. arXiv.

Brightwell, Graham and Winkler, P (2007) Submodular percolation. LSE-CDAM-2007-13. London school of economics and political science, London, UK.

Alon, Noga, Brightwell, Graham, Kierstead, H. A., Kostochka, A. V. and Winkler, Peter (2004) Dominating sets in k-majority tournaments. CDAM research report series, LSE-CDAM-2004-11. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Brightwell, Graham and Winkler, Peter (2004) Note on counting Eulerian circuits. CDAM research report series, LSE-CDAM-2004-12. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Brightwell, Graham and Winkler, Peter (2003) A second threshold for the hard-core model on a Bethe lattice. CDAM research report series, LSE-CDAM-2003-05. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Conference or Workshop Item

Brightwell, Graham, Panagiotou, Konstantinos and Steger, Angelika (2007) On extremal subgraphs of random graphs. In: 18th ACM-SIAM Symposium on Discrete Algorithms, 7 - 9 January, New Orleans, Louisiana.

Brightwell, Graham and Winkler, Peter (2005) Counting Eulerian circuits is #P-complete. In: Workshop on analytic algorithmics and combinatorics, 22 Jan 2005, Vancouver, Canada.