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:20230523T100000
DTEND;TZID=Europe/Paris:20230523T110000
DTSTAMP:20260424T150746
CREATED:20230509T112831Z
LAST-MODIFIED:20230523T073054Z
UID:11198-1684836000-1684839600@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Mostafa Gholami (GREYC\, Caen) « Multicolor bipartite Ramsey numbers for paths\, cycles\, and stripes »
DESCRIPTION:Frank Ramsey introduced the theory that bears his name in 1930. The main subject of the theory are complete graphs whose subgraphs can have some regular properties. Most commonly\, we look for monochromatic complete subgraphs\, i.e.\, complete subgraphs in which all of the edges have the same color. Ramsey numbers have attracted the attention of many mathematicians due to their many applications in various fields such as graph theory\, geometry\, logic\, information theory\, and number theory. Computing exact values for Ramsey numbers is a rather hard task. A huge amount of computational power is needed to generate all colorings of graphs and check the conditions that should be satisfied by the subgraphs. Given bipartite graphs $G_1\, G_2\, . . . \, G_t)$\, the multicolor bipartite Ramsey number $BR(G_1\, G_2\, . . . \, G_t)$ is the smallest positive integer $b$\, such that any $t$-edge-coloring of $K_{b\,b}$ contains a monochromatic subgraph isomorphic to $G_i$ colored with the i-th color for some 1 ≤ i ≤ t. In the upcoming seminar\, I will present my latest results on bipartite Ramsey numbers for paths\, cycles\, and matchings.
URL:https://www.greyc.fr/event/seminaire-algorithmique-mostafa-gholami-greyc-caen/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,Séminaire Algo
END:VEVENT
END:VCALENDAR