Geoffrey Grimmett

University of Cambridge
Scientific, Seminar
Probability Seminar: Geoffrey Grimmett
November 21, 2012
University of British Columbia
How small/large can be the connective constant of a regular graph? We give sharp inequalities for transitive graphs, and we explain how to prove strict inequalities as the graph varies. (joint work with Zhongyang Li)