BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20231107T163000
DTEND;TZID=Asia/Seoul:20231107T173000
DTSTAMP:20260418T211144
CREATED:20230803T141247Z
LAST-MODIFIED:20240705T161256Z
UID:7449-1699374600-1699378200@dimag.ibs.re.kr
SUMMARY:Bruce A. Reed\, Some Variants of the Erdős-Sós Conjecture
DESCRIPTION:Determining the density required to ensure that a host graph G contains some target graph as a subgraph or minor is a natural and well-studied question in extremal combinatorics. The celebrated 50-year-old Erdős-Sós conjecture states that for every k\, if G has average degree exceeding k-2 then it contains every tree T with k vertices as a subgraph. This is tight as the clique with k-1 vertices contains no tree with k vertices as a subgraph. \nWe present some variants of this conjecture. We first consider replacing bounds on the average degree by bounds on the minimum and maximum degrees. We then consider replacing subgraph by minor in the statement.
URL:https://dimag.ibs.re.kr/event/2023-11-07/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR