BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:2d351d9d-28d9-4ef5-aa44-135281db0da8
X-WR-CALNAME:[gt.go] - 'Three-cuts are a charm: acyclicity in 3-connected c
 ubic graphs' by František Kardoš
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:2d351d9d-28d9-4ef5-aa44-135281db0da8
DTSTAMP:20260406T222458Z
CLASS:PUBLIC
DESCRIPTION:/Exposé /Talk/ \n\nLet G be a bridgeless cubic graph. Recently\
 , in collaboration with Edita Máčajová and Jean Paul Zerafa\, we have solv
 ed a conjecture (also known as the S4-Conjecture) made by Mazzuoccolo in 2
 013: there exist two perfect matchings of G such that the complement of th
 eir union is a bipartite subgraph of G. (There was a talk on this topic in
  June 2022.) \n\nThis is a step closer to comprehend better the Fan--Raspa
 ud Conjecture and eventually the Berge--Fulkerson Conjecture. The S4-Conje
 cture\, now a theorem\, is also the weakest assertion in a series of three
  conjectures made by Mazzuoccolo in 2013\, with the next stronger statemen
 t being: there exist two perfect matchings of G such that the complement o
 f their union is an acyclic subgraph of G. Unfortunately\, this conjecture
  is not true: Jin\, Steffen\, and Mazzuoccolo showed that there exists a c
 ounterexample admitting 2-cuts. Here we show that\, despite of this\, ever
 y cyclically 3-edge-connected cubic graph satisfies this second conjecture
 . \n\n[František Kardoš] (Université de Bordeaux\, LaBRI ) \nhttps://www.l
 abri.fr/perso/fkardos/ \n\n\nRemarks / Remarques \n\nFind all the informat
 ion of the working group on this [ https://graphesetoptimisation.labri.fr/
 pmwiki.php/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les inf
 ormations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.
 php/Groupe/GT | page web ] .
DTSTART;TZID=Europe/Paris:20231201T140000
DTEND;TZID=Europe/Paris:20231201T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Three-cuts are a charm: acyclicity in 3-connected cubic 
 graphs' by František Kardoš
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
