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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200901T103000
DTEND;TZID=Asia/Seoul:20200901T113000
DTSTAMP:20260419T205104
CREATED:20200825T130632Z
LAST-MODIFIED:20240707T082809Z
UID:2855-1598956200-1598959800@dimag.ibs.re.kr
SUMMARY:Junguk Lee (이정욱)\, A quick introduction to stability and NIP: Part III. NIP
DESCRIPTION:I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. We review basic properties of stability and NIP. Finally\, we aim to give several characterizations of stability and NIP of a given formula in terms of counting types and definability types.
URL:https://dimag.ibs.re.kr/event/2020-09-01/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200908T163000
DTEND;TZID=Asia/Seoul:20200908T173000
DTSTAMP:20260419T205104
CREATED:20200820T123810Z
LAST-MODIFIED:20240705T194152Z
UID:2831-1599582600-1599586200@dimag.ibs.re.kr
SUMMARY:Rutger Campbell\, Disasters in abstracting combinatorial properties of linear dependence
DESCRIPTION:Let E be a finite set and I be a collection of subsets of E. When is there a set of real vectors indexed by E such that I correspond to its linearly independent subsets? In 1935\, Whitney introduced matroids using some necessary conditions for this. However\, complete characterizations with various techniques are intractable. This remains the case even if it is already known that there is a set of complex vectors indexed by E whose collection of linearly independent subsets corresponds to I.
URL:https://dimag.ibs.re.kr/event/2020-09-08/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200915T163000
DTEND;TZID=Asia/Seoul:20200915T173000
DTSTAMP:20260419T205104
CREATED:20200901T083403Z
LAST-MODIFIED:20240705T194142Z
UID:2919-1600187400-1600191000@dimag.ibs.re.kr
SUMMARY:Debsoumya Chakraborti\, Maximum number of cliques in a graph with bounded maximum degree
DESCRIPTION:Generalized extremal problems have been one of the central topics of study in extremal combinatorics throughout the last few decades. One such simple-looking problem\, maximizing the number of cliques of a fixed order in a graph with a fixed number of vertices and given maximum degree\, was recently resolved by Chase. Settling a conjecture of Kirsch and Radcliffe\, we resolve the edge variant of this problem\, where the number of edges is fixed instead of the number of vertices. This talk will be based on joint work with Da Qi Chen.
URL:https://dimag.ibs.re.kr/event/2020-09-15/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200922T163000
DTEND;TZID=Asia/Seoul:20200922T173000
DTSTAMP:20260419T205104
CREATED:20200914T065243Z
LAST-MODIFIED:20240707T082727Z
UID:2960-1600792200-1600795800@dimag.ibs.re.kr
SUMMARY:Jinha Kim (김진하)\, Collapsibility of Non-Cover Complexes of Graphs
DESCRIPTION:Let $G$ be a graph on the vertex set $V$. A vertex subset $W \subset V$ is a cover of $G$ if $V \setminus W$ is an independent set of $G$\, and $W$ is a non-cover of $G$ if $W$ is not a cover of $G$. The non-cover complex of $G$ is a simplicial complex on $V$ whose faces are non-covers of $G$. Then the non-cover complex of $G$ is the combinatorial Alexander dual of the independence complex of $G$. In this talk\, I will show the $(|V(G)|-i\gamma(G)-1)$-collapsibility of the non-cover complex of a graph $G$ where $i\gamma(G)$ denotes the independence domination number of $G$ using the minimal exclusion sequence method. This is joint work with Ilkyoo Choi and Boram Park.
URL:https://dimag.ibs.re.kr/event/2020-09-22/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200929T163000
DTEND;TZID=Asia/Seoul:20200929T173000
DTSTAMP:20260419T205104
CREATED:20200921T045326Z
LAST-MODIFIED:20240705T194112Z
UID:3014-1601397000-1601400600@dimag.ibs.re.kr
SUMMARY:Minki Kim (김민기)\, Complexes of graphs with bounded independence number
DESCRIPTION:Let $G$ be a graph on $V$ and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose faces are the subsets of $V$ that do not contain an independent set of size $n$ in $G$. We study the collapsibility numbers of $I_n(G)$ for various classes of graphs\, focusing on the class of graphs with bounded maximum degree. This is joint work with Alan Lew.
URL:https://dimag.ibs.re.kr/event/2020-09-29/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR