BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Maximising the number of induced cycles - Natasha Morrison (Univer
 sity of Cambridge)
DTSTART:20171130T143000Z
DTEND:20171130T153000Z
UID:TALK85831@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:How many induced cycles can a graph on n vertices contain?\nFo
 r sufficiently large n\, we determine the maximum number of induced cycles
  and the maximum number of even or odd induced cycles. We also characteriz
 e the graphs achieving this bound in each case. This answers a question of
  Tuza\, and a conjecture of Chvátal and Tuza from 1988.  Joint work with 
 Alex Scott.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR