BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.32.0//EN
X-ORIGINAL-URL:https://www.cmm.uchile.cl/
X-WR-CALNAME:CMM
X-WR-CALDESC:Centro de Modelamiento Matemático
X-WR-TIMEZONE:America/Santiago
BEGIN:VTIMEZONE
TZID:America/Santiago
X-LIC-LOCATION:America/Santiago
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
TZNAME:-04
DTSTART:20260531T044027
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-ec19d0f9e3a0071fc1012686ea83ac9e@cmm.uchile.cl
DTSTART;TZID=America/Santiago:20260527T100000
DTEND;TZID=America/Santiago:20260527T120000
DTSTAMP:20260526T173333Z
CREATED:20260526
LAST-MODIFIED:20260526
PRIORITY:5
SEQUENCE:1
TRANSP:OPAQUE
SUMMARY:Graph Theory Seminar: “Minimum degree threshold for covering bipartite graphs with monochromatic components”
DESCRIPTION: Abstract:\nCovering the vertices of edge-coloured graphs with monochromatic components has been a beloved pastime of combinatorialists for decades, largely motivated by a celebrated conjecture of Ryser. Some years ago, Bal and DeBiasio inquired about the minimum degree threshold that guarantees that the vertex set of an r-edge-coloured graph can be covered with at most r monochromatic components. This question has since led to many more related problems and accompanying results. Most notably, Girao, Letzter and Sahasrabudhe proved that every large enough n-vertex 2-edge-coloured graph with minimum degree exceeding (2n-5)/3 can be covered with at most two monochromatic components.\nIn a recent paper, Fernandez, Pavez-Signe and Stein worked on an analogous problem for bipartite graphs. Namely, they proved that every large enough 2n-vertex, 2-edge-coloured, balanced bipartite graph with minimum degree at least (13/16 + ε)n can be covered with at most three monochromatic components. That said, they expected the threshold to be around 2n/3. In this talk, I will prove that they were right.\nThis is joint work with Cesar Bispo, Marcelo Lage, Guilherme Mota and Bruno Skarmeta.\n\nSpeaker: George Kontogeorgiou (CMM)\n \n
URL:https://www.cmm.uchile.cl/events/graph-theory-seminar-minimum-degree-threshold-for-covering-bipartite-graphs-with-monochromatic-components/
ORGANIZER;CN=CMM:MAILTO:
CATEGORIES:Seminarios
LOCATION:Sala John Von Neumann, 7th floor, Beauchef 851
END:VEVENT
END:VCALENDAR