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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20190603T163000
DTEND;TZID=Asia/Seoul:20190603T173000
DTSTAMP:20260423T071815
CREATED:20190411T160640Z
LAST-MODIFIED:20240707T090357Z
UID:770-1559579400-1559583000@dimag.ibs.re.kr
SUMMARY:Jinyoung Park (박진영)\, The number of maximal independent sets in the Hamming cube
DESCRIPTION:Let $Q_n$ be the $n$-dimensional Hamming cube (hypercube) and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically $2n2^{N/4}$\, as was conjectured by Ilinca and Kahn in connection with a question of Duffus\, Frankl and Rödl. The value is a natural lower bound derived from a connection between maximal independent sets and induced matchings. The proof of the upper bound draws on various tools\, among them “stability” results for maximal independent set counts and old and new results on isoperimetric behavior in $Q_n$. This is joint work with Jeff Kahn.
URL:https://dimag.ibs.re.kr/event/2019-06-03/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20190619T163000
DTEND;TZID=Asia/Seoul:20190619T173000
DTSTAMP:20260423T071815
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
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20190625T163000
DTEND;TZID=Asia/Seoul:20190625T173000
DTSTAMP:20260423T071815
CREATED:20190520T133325Z
LAST-MODIFIED:20240707T090302Z
UID:913-1561480200-1561483800@dimag.ibs.re.kr
SUMMARY:Patrice Ossona de Mendez\, A model theoretical approach to sparsity
DESCRIPTION:We discuss how the model theoretic notion of first-order transduction allows to define a notion of structural sparsity\, and give some example of applications\, like existence of low shrub-depth decompositions for tranductions of bounded expansion classes\, characterization of transductions of classes with bounded pathwidth\, decompositions of graphs with bounded rank-width into cographs.
URL:https://dimag.ibs.re.kr/event/2019-06-25/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR