BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY: Graphs forced by rainbow stars - Peter Wagner (Rostock)
DTSTART:20240523T133000Z
DTEND:20240523T143000Z
UID:TALK216928@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:We study colourings of the edges of the complete graph K_n.\nF
 or some graph H\, we say that a colouring contains a rainbow H\, if there 
 is an embedding of H into K_n\, such that all edges of the embedded copy h
 ave pairwise distinct colours.\nOnly two special types of rainbow trees of
  small diameter are forced by a high number of vertices of high colour deg
 ree\, and then only two rainbow stars suffice.\nWhilst the optimal colour 
 degree is known for one type of trees\, we will discuss some bounds for th
 e other type (of larger diameter).
LOCATION:MR12
END:VEVENT
END:VCALENDAR