BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On the CNF complexity of graphs with no K_{2\,2}'s - Nets Hawk Kat
 z (Indiana/Caltech)
DTSTART:20121031T160000Z
DTEND:20121031T170000Z
UID:TALK39457@talks.cam.ac.uk
CONTACT:Ben Green
DESCRIPTION:We disprove an old conjecture of Pudlak\, Rodl\, and Savicky r
 egarding\nthe graph complexity of bipartite graphs containing no K_{2\,2}'
 s. We\ndescribe the significance of this conjecture\nand make a conjecture
  which is a suitable replacement.
LOCATION:MR11\, CMS
END:VEVENT
END:VCALENDAR