BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Monochromatic tight cycle partition for 3-graphs - Allan Lo (Unive
 rsity of Birmingham)
DTSTART:20190516T133000Z
DTEND:20190516T143000Z
UID:TALK122734@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:A conjecture of Lehel states that every $2$-edge-coloured comp
 lete graph can be partitioned into two disjoint monochromatic cycles. This
  conjecture was confirmed by Bessy and Thomass\\'e. We prove that its anal
 ogous result holds for tight cycles in $3$-uniform hypergraph\, that is\, 
 every $2$-edge-coloured (large) complete $3$-uniform hypergraph can be par
 titioned into two monochromatic tight\ncycles.\nThis is joint work with Fr
 ederik Garbe\, Richard Lang\, Richard Mycroft and Nicol\\'{a}s Sanhueza-Ma
 tamala.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR