BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A problem of Erdos and Sos on 3-graphs - Roman Glebov (ETH\, Zuric
 h)
DTSTART:20140529T133000Z
DTEND:20140529T143000Z
UID:TALK52478@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We show that for every positive epsilon there exist positive d
 elta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with 
 the property that every k-vertex subset\, where k>=delta*n\, induces at le
 ast (1/4 + epsilon)*{k \\choose 3} edges\, contains K4- as a subgraph\, wh
 ere K4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This quest
 ion was originally raised by Erdos and Sos. The constant 1/4 is\nthe best 
 possible.\nJoint work with Dan Kral and Jan Volec.\n
LOCATION:Centre for Mathematical Sciences\, MR13
END:VEVENT
END:VCALENDAR