BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Complete Graphs with No Rainbow Tree - Peter Wagner (University of
  Rostock)
DTSTART:20180524T133000Z
DTEND:20180524T143000Z
UID:TALK101359@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We study colourings of the edges of the complete graph K_n. Fo
 r some graph H\, we say that a colouring contains a rainbow H\, if there i
 s an embedding of H into K_n\, such that all edges of the embedded copy ha
 ve pairwise distinct colours.\nThe main emphasis of the talk is a classifi
 cation of those forbidden rainbow graphs that force a low number of vertic
 es of a high colour degree\, along with some specifications and more gener
 al information in certain cases. Those graphs turn out to be of two specia
 l types of trees of small diameter
LOCATION:MR13
END:VEVENT
END:VCALENDAR