skip to content

The upper bound on number of graphs, with fixed number of vertices, that vertices can be coloured with n colours

Presented by: 
K Kulesza [IFTR]
Wednesday 18th June 2008 - 10:00 to 11:00
INI Seminar Room 2
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons