BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv5.1.2//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
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200331T163000
DTEND;TZID=Asia/Seoul:20200331T173000
DTSTAMP:20200602T012413
CREATED:20200324T132402Z
LAST-MODIFIED:20200324T132524Z
UID:2222-1585672200-1585675800@dimag.ibs.re.kr
SUMMARY:Ringi Kim (김린기)\, The strong clique number of graphs with forbidden cycles
DESCRIPTION:The strong clique number of a graph $G$ is the maximum size of a set of edges of which every pair has distance at most two. \nIn this talk\, we prove that every $\{C_5\,C_{2k}\}$-free graph has strong clique number at most $k\Delta(G)-(k-1)$\, which resolves a conjecture by Cames van Batenburg et al. We also prove that every $C_{2k}$-free graph has strong clique number at most $(2k−1)\Delta(G) + (2k−1)^2$\, improving the previous known upper bound $10k^2 (\Delta(G)-1)$ due to Cames van Batenburg et al. This is joint work with Eun-Kyung Cho\, Ilkyoo Choi\, and Boram Park. \n
URL:https://dimag.ibs.re.kr/event/2020-03-31/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR