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:20210119T163000
DTEND;TZID=Asia/Seoul:20210119T173000
DTSTAMP:20260419T132332
CREATED:20210114T070412Z
LAST-MODIFIED:20240705T191136Z
UID:3498-1611073800-1611077400@dimag.ibs.re.kr
SUMMARY:Ben Lund\, Perfect matchings and derangements on graphs
DESCRIPTION:We show that each perfect matching in a bipartite graph G intersects at least half of the perfect matchings in G. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph\, and in terms of derangements and permutations on graphs. We give several related results and open questions. This is joint work with Matija Bucic\, Pat Devlin\, Mo Hendon\, and Dru Horne.
URL:https://dimag.ibs.re.kr/event/2021-01-19/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR