BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:a4b6207b-0374-4b2a-a0b1-0c1607ad1759
X-WR-CALNAME:[gt.go] - 'Maximising line subgraphs of diameter at most t' by
  Stijn Cambie
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20231029T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20211031T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20221030T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20210328T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20220327T020000
RDATE:20230326T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:a4b6207b-0374-4b2a-a0b1-0c1607ad1759
DTSTAMP:20260408T112623Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/ \n\nWe consider an edge ver
 sion of the famous (and hard) degree-diameter problem\, where one is wonde
 ring about the maximum size of a graph given maximum degree and diameter o
 f the line graph. This problem originated from 1988 and was proposed by Er
 dos and Nesetril. It was the inspiration for a series of research papers o
 n variants of this problem. We will start discussing part of the history\,
  which is related with e.g. the (still widely open) strong edge colouring 
 conjecture. In the second part of the talk\, we will look again to the ini
 tial inspirational question and the ideas behind some progress on this. \n
 \n[Stijn Cambie ] ( Radboud University\, Nimègue ) \n\nhttps://www.math.ru
 .nl/~stijncambie/ \n\n\n\nRemarques / Remarks \n\nFind all the information
  of the working group on the web page [ https://graphesetoptimisation.labr
 i.fr/pmwiki.php/Groupe/GT?userlang=en ] https://graphesetoptimisation.labr
 i.fr/pmwiki.php/Groupe/GT?userlang=en \n\nRetrouvez toutes les information
 s du GT sur [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT 
 ] https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT
DTSTART;TZID=Europe/Paris:20211112T140000
DTEND;TZID=Europe/Paris:20211112T150000
LOCATION:A30/178 et sur https://u-bordeaux-fr.zoom.us/j/4939941120
SEQUENCE:0
SUMMARY:[gt.go] - 'Maximising line subgraphs of diameter at most t' by Stij
 n Cambie
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
