BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:f59af165-2867-4405-b266-984409507991
X-WR-CALNAME:[gt.go] - 'A tamed family of triangle-free graphs with unbound
 ed chromatic number' by Romain Bourneuf
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:f59af165-2867-4405-b266-984409507991
DTSTAMP:20260606T030435Z
CLASS:PUBLIC
DESCRIPTION:** Une famille de graphe sans triangles avec certaines propriét
 és ** \n\n/Exposé /Talk/ \n\nWe construct a hereditary class of triangle-f
 ree graphs with unbounded chromatic number\, in which every non-trivial gr
 aph either contains a pair of non-adjacent twins or has an edgeless vertex
  cutset of size at most two. This answers in the negative a question of Ch
 udnovsky\, Penev\, Scott\, and Trotignon. The class is the hereditary clos
 ure of a family of triangle-free twincut graphs $G_1\, G_2\, \ldots$ such 
 that $G_k$ has chromatic number $k$. We study various properties of these 
 graphs highlighting their strikingly low structural complexity. Joint work
  with Édouard Bonnet\, Julien Duron\, Colin Geniet\, Stéphan Thomassé and 
 Nicolas Trotignon. \n\n\n[Romain Bourneuf ] (LaBRI ) \nhttp://perso.ens-ly
 on.fr/romain.bourneuf/ \n\nRemarks / Remarques \n\nFind all the informatio
 n of the working group on this [ https://graphesetoptimisation.labri.fr/pm
 wiki.php/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les infor
 mations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.ph
 p/Groupe/GT | page web ] .
DTSTART;TZID=Europe/Paris:20240906T140000
DTEND;TZID=Europe/Paris:20240906T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'A tamed family of triangle-free graphs with unbounded ch
 romatic number' by Romain Bourneuf
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
