[Facets-of-complexity] Invitation to Monday Lecture & Colloquium Oct. 25 !

["I.Brunke" <i.brunke@fu-berlin.de>]

Dear all,

we will start winter term's Monday Lectures October 25. You all are cordially invited!
We now will have a Colloquium on Monday Oct.25 !

Please note Corona restrictions !  - See rules in detail below !

Monday's Lecture: Penny Haxell (University of Waterloo)

Location:

Room 005 - Ground Floor
Freie Universität Berlin
Takustr. 9
14195 Berlin

Time: Monday, October 25th - 14:15 h

Title: Tashkinov trees

Abstract:

The technique of Tashkinov trees is an important tool that has been used to obtain many significant results on edge colouring of multigraphs. We describe the method and its main motivation, the famous Goldberg-Seymour conjecture from the 1970's. We also outline several results from the last decade that have used the Tashkinov trees technique.
This talk is also an introduction, overview and survey to accompany the upcoming short course "Edge colouring of multigraphs and the Tashkinov trees method" Oct 26-29.


Coffee Break

Monday's Colloquium: Simona Boyadzhiyska (Freie Universität Berlin)

Location:

Room 005 - Ground Floor
Freie Universität Berlin
Takustr. 9
14195 Berlin

Time: Monday, October 25th - 16:00 h s.t.

Title: Ramsey simplicity of random graphs

Abstract:

We say that a graph G is q-Ramsey for another graph H if any q-coloring of the edges of G yields a monochromatic copy of H. Much of the research related to Ramsey graphs is concerned with determining the smallest possible number of vertices in a q-Ramsey graph for a given H, known as the q-color Ramsey number of H. In the 1970s, Burr, Erdős, and Lovász initiated the study of another graph parameter in the context of Ramsey graphs: the minimum degree. 
A straightforward argument shows that, if G is a minimal q-Ramsey graph for H, then we must have δ(G) >= q(δ(H) - 1) + 1, and we say that H is q-Ramsey simple if this bound can be attained. In this talk, we will ask how typical Ramsey simplicity is; more precisely, we will discuss for which pairs p and q the random graph G(n,p) is almost surely q-Ramsey simple.
This is joint work with Dennis Clemens, Shagnik Das, and Pranshu Gupta.


Corona access rules:

Please observe the current Corona safety constraints:

3G access rule - a medical or FFP2 mask must be worn!
See https://www.fu-berlin.de/en/sites/coronavirus/faq/studium/3g/

Please bring a proof of your vaccination status or test by a certified unit, as well as a photo-ID.

We will regularly open the windows for fresh air.
Please choose your clothing accordingly!

For tracking the contacts in case of an infection, we use a.nwesen.de.
See https://anwesende.imp.fu-berlin.de/

There is a QR-code at every place, which you can scan with your smartphone.


You all are cordially invited!

Virenfrei. www.avast.com