WorldCat Identities

Brightwell, Graham

Overview
Works: 26 works in 38 publications in 2 languages and 253 library holdings
Roles: Author
Classifications: QA164, 511.6
Publication Timeline
.
Most widely held works by Graham Brightwell
Combinatorics and probability : celebrating Béla Bollabás's 60th birthday( Book )

2 editions published in 2007 in English and held by 136 WorldCat member libraries worldwide

The structure of random discrete spacetime by Graham Brightwell( Book )

1 edition published in 1990 in English and held by 75 WorldCat member libraries worldwide

Combinatorics and probability celebrating Béla Bollobás's 60th birthday( Book )

5 editions published in 2007 in English and held by 12 WorldCat member libraries worldwide

A resilience strategy for a single source destination pair by Graham Brightwell( Book )

3 editions published in 1996 in English and held by 6 WorldCat member libraries worldwide

Reorientations of covering graphs by Graham Brightwell( Book )

4 editions published in 1988 in German and English and held by 6 WorldCat member libraries worldwide

A linear bound on the diameter of the transportation polytope by G Brightwell( Book )

2 editions published in 2003 in English and held by 4 WorldCat member libraries worldwide

Linear extensions of partially ordered sets by Graham Brightwell( Book )

2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide

Combinatronics and probability : celebrating Béla Bollobás's 60th birthday( Book )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Counting linear extensions is #P-complete by Graham Brightwell( Book )

1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide

Special issue on Ramsey theory( Book )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Special issue in honour of Béla Bollobás on his 60th birthday( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

Special issue in honour of Tom Trotter on his 65th birthday : papers from "New directions in algorithms, combinatorics and optimization"( )

1 edition published in 2009 in English and held by 1 WorldCat member library worldwide

Consultancy report by Graham Brightwell( Book )

1 edition published in 1996 in English and held by 1 WorldCat member library worldwide

New directions in algorithms, combinatorics and optimization : papers dedicated to Tom Trotter on the occasion of his 65th birthday( Book )

1 edition published in 2009 in English and held by 1 WorldCat member library worldwide

Submodular percolation by Graham Brightwell( )

1 edition published in 2007 in English and held by 0 WorldCat member libraries worldwide

Extremal subgraphs of random graphs: an extended version by Graham Brightwell( )

1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question of Babai, Simonovits and Spencer (Journal of Graph Theory, 1990). The proof is based on a tool of independent interest: we show, for instance, that the maximum cut of almost all graphs with $M$ edges, where $M >> n$, is ``nearly unique''. More precisely, given a maximum cut $C$ of $G_{n,M}$, we can obtain all maximum cuts by moving at most $O(\sqrt{n^3/M})$ vertices between the parts of $C$
Graph homomorphisms and long range action by Graham Brightwell( )

1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide

Partially ordered sets by Graham Brightwell( )

1 edition published in 2000 in English and held by 0 WorldCat member libraries worldwide

On extremal subgraphs of random graphs by Graham Brightwell( )

1 edition published in 2007 in English and held by 0 WorldCat member libraries worldwide

Let K-l denote the complete graph on vertices. We prove that there is a constant c = c(l) > 0, such that whenever p >= n(-c), with probability tending to 1 when n goes to infinity, every maximum K-l-free subgraph of the binomial random graph G(n,p) is (l-1)-partite. This answers a question of Babai, Simonovits and Spencer [3]. The proof is based on a tool of independent interest: we show, for instance, that the maximum cut of almost all graphs with M edges, where M >> n, is nearly unique. More precisely, given a maximum cut C of G(n,m), we can obtain all maximum cuts by moving at most O (root n(3/)M) vertices between the parts of C
On external subgraphs of a random graph by Graham Brightwell( )

1 edition published in 2007 in English and held by 0 WorldCat member libraries worldwide

Held in New Orleans, LA, January 7-9, 2007. This symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.68 (from 0.55 for Special is ... to 1.00 for On externa ...)

Combinatorics and probability : celebrating Béla Bollabás's 60th birthdayCombinatorics and probability celebrating Béla Bollobás's 60th birthdayCombinatronics and probability : celebrating Béla Bollobás's 60th birthday
Alternative Names
Brightwell, Graham R.

Brightwell, Graham Richard.

Graham Brightwell Mathematician

Languages
English (30)

German (2)

Covers
Combinatorics and probability celebrating Béla Bollobás's 60th birthdayCombinatronics and probability : celebrating Béla Bollobás's 60th birthday