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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230710T163000
DTEND;TZID=Asia/Seoul:20230710T173000
DTSTAMP:20260419T042602
CREATED:20230410T004309Z
LAST-MODIFIED:20240707T073602Z
UID:6987-1689006600-1689010200@dimag.ibs.re.kr
SUMMARY:Xuding Zhu (朱緒鼎)\, List version of 1-2-3 conjecture
DESCRIPTION:The well-known 1-2-3 Conjecture by Karoński\, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1\, 2 or 3 so that for each edge $uv$ the sums of the weights at $u$ and at $v$ are distinct. The list version of the 1-2-3 Conjecture by Bartnicki\, Grytczuk and Niwczyk states that the same holds if each edge $e$ has the choice of weights not necessarily from $\{1\,2\,3\}$\, but from any set $\{x(e)\,y(e)\,z(e)\}$ of three real numbers. The goal of this talk is to survey developments on the 1-2-3 Conjecture\, especially on the list version of the 1-2-3 Conjecture.
URL:https://dimag.ibs.re.kr/event/2023-07-10/
LOCATION:Room B109\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR