BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Combinatorics Seminar
SUMMARY: Graphs forced by rainbow stars - Peter Wagner (Ro
 stock)
DTSTART;TZID=Europe/London:20240523T143000
DTEND;TZID=Europe/London:20240523T153000
UID:TALK216928AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/216928
DESCRIPTION:We study colourings of the edges of the complete g
 raph K_n.\nFor some graph H\, we say that a colour
 ing contains a rainbow H\, if there is an embeddin
 g of H into K_n\, such that all edges of the embed
 ded copy have pairwise distinct colours.\nOnly two
  special types of rainbow trees of small diameter 
 are forced by a high number of vertices of high co
 lour degree\, and then only two rainbow stars suff
 ice.\nWhilst the optimal colour degree is known fo
 r one type of trees\, we will discuss some bounds 
 for the other type (of larger diameter).
LOCATION:MR12
CONTACT:
END:VEVENT
END:VCALENDAR