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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20191010T163000
DTEND;TZID=Asia/Seoul:20191010T173000
DTSTAMP:20260422T195455
CREATED:20190710T015315Z
LAST-MODIFIED:20240707T090044Z
UID:1081-1570725000-1570728600@dimag.ibs.re.kr
SUMMARY:Alexandr V. Kostochka\, Reconstructing graphs from smaller subgraphs
DESCRIPTION:A graph or graph property is $\ell$-reconstructible if it is determined by the multiset of all subgraphs obtained by deleting $\ell$ vertices. Apart from the famous Graph Reconstruction Conjecture\, Kelly conjectured in 1957 that for each $\ell\in\mathbb N$\, there is an integer $n=n(\ell)$ such that every graph with at least $n$ vertices is $\ell$-reconstructible. \nWe show that for each $n\ge7$ and every $n$-vertex graph $G$\, the degree list and connectedness of $G$ are $3$-reconstructible\, and the threshold $n\geq 7$ is sharp for both properties.‌ We also show that all $3$-regular graphs are $2$-reconstructible.
URL:https://dimag.ibs.re.kr/event/2019-10-10/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR