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:20190619T163000
DTEND;TZID=Asia/Seoul:20190619T173000
DTSTAMP:20260423T090721
CREATED:20190418T080534Z
LAST-MODIFIED:20240707T090333Z
UID:789-1560961800-1560965400@dimag.ibs.re.kr
SUMMARY:Suil O (오수일)\, An odd [1\,b]-factor in regular graphs from eigenvalues
DESCRIPTION:An odd $[1\,b]$-factor of a graph is a spanning subgraph $H$ such that for every vertex $v \in V(G)$\, $1 \le d_H(v) \le b$\, and $d_H(v)$ is odd. For positive integers $r \ge 3$ and $b \le r$\, Lu\, Wu\, and Yang gave an upper bound for the third largest eigenvalue in an $r$-regular graph with even number of vertices to guarantee the existence of an odd [1\,b]-factor.\nIn this talk\, we improve their bound.
URL:https://dimag.ibs.re.kr/event/2019-06-19/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR