BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240416T100000
DTEND;TZID=Europe/Paris:20240416T110000
DTSTAMP:20260422T074505
CREATED:20240304T100149Z
LAST-MODIFIED:20240513T081701Z
UID:11454-1713261600-1713265200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Domination in subcubic graphs: swapping numbers »\, Paul Dorbec (GREYC\, Caen)
DESCRIPTION:In 1996\, Bruce Reed worked on domination in cubic graphs\, and came to the conclusion that 1/3 of the vertices should suffice in dominating connected cubic graphs. Things are not that simple as there are some counter-examples\, but the problem still attracted attention (and gave birth to conjectures). In 2008\, Lowenstein and Rautenbach made a relatively short paper (almost 9 pages) proving that the bound holds for graphs with girth 83. After coming back on any graph theoretical concept necessary to understand the proof\, I will present how to swap this two numbers\, i.e. how to prove that the bound holds for graph of girth 9 in a 83 pages paper…
URL:https://www.greyc.fr/event/seminaire-algorithmique-antonin-reitz-inria-paris/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR