Noble, S (Brunel)
Thursday 01 May 2008, 14:00-15:00

The clustering coefficient of a scale-free random graph

The past half-decade has seen an increasing interaction between combinatorialists, probabilists, computer scientists and theoretical physicists concerned broadly with the study of "probability theory on graphs" or "statistical mechanics on graphs".

The programme will build on this cross-fertilisation. It is particularly timely for a number of reasons:
* methods from mathematical physics are beginning to make their mark on previously intractable combinatorial problems;
* increasing computer power, together with the wide availability of symbolic-algebra packages, has brought the possibility of exploration of non-trivial examples; 
* phase transitions are increasingly being investigated on a wide variety of combinatorial structures, including matroids, set partitions and constraint satisfaction problems, as well as graphs.

Read more at: www.newton.ac.uk/programmes/CSM/

Royle, G  (Western Australia)
Thursday 12 June 2008, 11:00-12:00

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Jackson, B (QMUL)
Thursday 05 June 2008, 16:00-17:00

Zero-free regions for multivariate Tutte polynomials

Faris, W (Arizona)
Thursday 15 May 2008, 16:00-17:00

Trees versus connected graphs II

Penman, D (Essex)
Friday 09 May 2008, 14:00-15:00

Random randomly coloured graphs

Faris, W (Arizona)
Thursday 08 May 2008, 16:00-17:00

The clustering coefficient of a scale-free random graph

Download our free app to listen on your phone