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:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20231128T100000
DTEND;TZID=Europe/Paris:20231128T110000
DTSTAMP:20260422T230050
CREATED:20231106T092629Z
LAST-MODIFIED:20240109T130345Z
UID:11306-1701165600-1701169200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Tough graphs and Hamiltonian degree conditions »\, Cléophée Robin (GREYC\, Caen)
DESCRIPTION:A graph G is Hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if\, for all subsets of vertices S\, the number of connected components in G − S is at most |S| / t. We extended a theorem of Hoàng by proving the following : Let G be a graph with degree sequence d1\,d2\,…\,dn and let t be a positive integer at most 6. If G is t-tough and if ∀ i\, t ≤ i <n/2\, di ≤ i ⇒ dn−i+t  ≥ n−i then G is Hamiltonian. To do this\, we extend the closure lemma due to Bondy and Chvàtal. \nThis is joint work with Chình T. Hoàng. \nCléophée Robin website
URL:https://www.greyc.fr/event/seminaire-algorithmique-tough-graphs-and-hamiltonian-degree-conditions-cleophee-robin-greyc-caen/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR