Charts
Combinatorics and Statistical MechanicsEpisode from the podcastCombinatorics and Statistical Mechanics
Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Released Tuesday, 1st July 2008
Good episode? Give it some love!
Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Tuesday, 1st July 2008
Good episode? Give it some love!
Rate Episode
List
About
InsightsPodchaser Pro
Reviews
Credits
Lists
Transcript

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

Show More
Rate
List
Get this podcast via API

From The Podcast

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/

Join Podchaser to...

  • Rate podcasts and episodes
  • Follow podcasts and creators
  • Create podcast and episode lists
  • & much more
Do you host or manage this podcast?
Claim and edit this page to your liking.
,
Podchaser Logo

Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More