BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Self-avoiding walk on regular graphs - Zhongyang Li (Cambridge)
DTSTART:20130528T153000Z
DTEND:20130528T163000Z
UID:TALK45367@talks.cam.ac.uk
CONTACT:12974
DESCRIPTION:A self-avoiding walk (SAW) is a path on a graph that revisits 
 no vertex. The connective constant of a graph is defined to be the exponen
 tial growth rate of the number of n-step SAWs with respect to n. We prove 
 that sqrt{d-1} is a universal lower bound for connective constants of any 
 infinite\, connected\, transitive\, simple\, d-regular graph. We also prov
 e that the connective constant of a Cayley graph decreases strictly when a
  new relator is added to the group and increases strictly when a non-trivi
 al word is declared to be a generator. Joint work with Geoffrey Grimmett.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR