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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200421T163000
DTEND;TZID=Asia/Seoul:20200421T173000
DTSTAMP:20260420T081759
CREATED:20200417T000545Z
LAST-MODIFIED:20240705T201135Z
UID:2349-1587486600-1587490200@dimag.ibs.re.kr
SUMMARY:Sang-il Oum (엄상일)\, Survey on vertex-minors
DESCRIPTION:For a vertex v of a graph G\, the local complementation at v is an operation to obtain a new graph denoted by G*v from G such that two distinct vertices x\, y are adjacent in G*v if and only if both x\, y are neighbors of v and x\, y are non-adjacent\, or at least one of x\, y is not a neighbor of v and x\, y are adjacent. A graph H is a vertex-minor of a graph G if H is obtained from G by a sequence of local complementation and vertex deletions. Interestingly vertex-minors have been used in the study of measurement-based quantum computing on graph states. \nMotivated by the big success of the graph minor structure theory developed deeply by Robertson and Seymour since 1980s\, we propose a similar theory for vertex-minors. This talk will illustrate similarities between graph minors and graph vertex-minors and give a survey of known theorems and open problems on vertex-minors of graphs.
URL:https://dimag.ibs.re.kr/event/2020-04-21/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR