BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210223T163000
DTEND;TZID=Asia/Seoul:20210223T173000
DTSTAMP:20260419T101044
CREATED:20210217T043908Z
LAST-MODIFIED:20240707T081835Z
UID:3637-1614097800-1614101400@dimag.ibs.re.kr
SUMMARY:Minki Kim (김민기)\, Rainbow paths and rainbow matchings
DESCRIPTION:We prove that if $n \geq 3$\, then any family of $3n-3$ sets of matchings of size $n$ in any graph has a rainbow matching of size $n$. This improves on a previous result\, in which $3n-3$ is replaced by $3n-2$. We also prove a “cooperative” generalization: for $t > 0$ and $n \geq 3$\, any $3n-4+t$ sets of edges\, the union of every $t$ of which contains a matching of size $n$\, have rainbow matching of size $n$. This is joint work with Ron Aharoni\, Joseph Briggs\, and Jinha Kim.
URL:https://dimag.ibs.re.kr/event/2021-02-23/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR