BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Plone.org//NONSGML plone.app.event//EN
X-WR-TIMEZONE:Europe/Madrid
BEGIN:VEVENT
SUMMARY:Computational geometry seminar 19-05-2016
DTSTART;TZID=Europe/Madrid:20160519T131500
DTEND;TZID=Europe/Madrid:20160519T141500
DTSTAMP:20260407T150457Z
UID:61f7d9beeb1e4ba3a50b578851c7f1c0@www.mat.upc.edu
CREATED:20160513T101431Z
DESCRIPTION:Speaker: Pilar Cano - \nUniversitat Politècnica de Catalunya 
 and Carleton University\n\nA rainbow matching in an edge colored hypergrap
 h is a matching such that each pair of its edges have distinct colors. Bru
 aldi\, Ryser and Stein conjectured the existence of a partial n-1 Latin tr
 ansversal in a Latin square n-matrix. This problem can be translated into 
 finding a rainbow matching in a complete bipartite graph. We extend the re
 sult of Erds and Spencer on the existence of rainbow matchings in the comp
 lete bipartite graph {n\,n} to complete r-partite r-uniform graphs\, compl
 ete bipartite graphs with repeated edges\, and d-regular bipartite graphs 
 minus a matching. The results use the Lopsided version of the Local Lovás
 z  Lemma.
LAST-MODIFIED:20211109T111852Z
LOCATION:Room S215 Omega Building\, Campus Nord UPC (equiv.: Room 215 Floo
 r -2)
URL:https://mat.upc.edu/ca/activitats/computational-geometry-seminar-19-05
 -2016
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Madrid
X-LIC-LOCATION:Europe/Madrid
BEGIN:DAYLIGHT
DTSTART:20160327T030000
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR