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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20191029T163000
DTEND;TZID=Asia/Seoul:20191029T173000
DTSTAMP:20260422T181457
CREATED:20191027T110551Z
LAST-MODIFIED:20240707T090010Z
UID:1632-1572366600-1572370200@dimag.ibs.re.kr
SUMMARY:Pascal Gollin\, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
DESCRIPTION:Given a cardinal $\lambda$\, a $\lambda$-packing of a graph $G$ is a family of $\lambda$ many edge-disjoint spanning trees of $G$\, and a $\lambda$-covering of $G$ is a family of spanning trees covering $E(G)$. \nWe show that if a graph admits a $\lambda$-packing and a $\lambda$-covering  then the graph also admits a decomposition into $\lambda$ many spanning trees. In this talk\, we concentrate on the case of $\lambda$ being an infinite cardinal. Moreover\, we will provide a new and simple proof for a theorem of Laviolette characterising the existence of a $\lambda$-packing\, as well as for a theorem of Erdős and Hajnal characterising the existence of a $\lambda$-covering.  \nJoint work with Joshua Erde\, Attila Joó\, Paul Knappe and Max Pitz.
URL:https://dimag.ibs.re.kr/event/2019-10-29/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR