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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20201103T163000
DTEND;TZID=Asia/Seoul:20201103T173000
DTSTAMP:20260419T164436
CREATED:20201022T132652Z
LAST-MODIFIED:20240705T193042Z
UID:3188-1604421000-1604424600@dimag.ibs.re.kr
SUMMARY:Jaeseong Oh (오재성)\, A 2-isomorphism theorem for delta-matroids
DESCRIPTION:Whitney’s 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. In this talk\, we present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic delta-matroids. This is based on the joint work with Iain Moffatt.
URL:https://dimag.ibs.re.kr/event/2020-11-03/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20201110T163000
DTEND;TZID=Asia/Seoul:20201110T173000
DTSTAMP:20260419T164436
CREATED:20201028T010325Z
LAST-MODIFIED:20240705T193037Z
UID:3212-1605025800-1605029400@dimag.ibs.re.kr
SUMMARY:Casey Tompkins\, Extremal forbidden poset problems in Boolean and linear lattices
DESCRIPTION:Extending the classical theorem of Sperner on the maximum size of an antichain in the Boolean lattice\, Katona and Tarján introduced a general extremal function $La(n\,P)$\, defined to be the maximum size of a family of subsets of $[n]$ which does not contain a given poset $P$ among its containment relations.  In this talk\, I will discuss what is known about the behavior of $La(n\,P)$ and its natural extension to the lattice of subspaces of a vector space over a finite field.  In particular\, I will highlight some recent joint work with Jimeng Xiao.  Many open problems will also be discussed.
URL:https://dimag.ibs.re.kr/event/2020-11-10/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20201124T163000
DTEND;TZID=Asia/Seoul:20201124T173000
DTSTAMP:20260419T164436
CREATED:20201111T070608Z
LAST-MODIFIED:20240705T193020Z
UID:3264-1606235400-1606239000@dimag.ibs.re.kr
SUMMARY:Duksang Lee (이덕상)\, Characterizing matroids whose bases form graphic delta-matroids
DESCRIPTION:We introduce delta-graphic matroids\, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular matroids. We give a structural characterization of the class of delta-graphic matroids. We also show that every forbidden minor for the class of delta-graphic matroids has at most 48 elements. This is joint work with Sang-il Oum.
URL:https://dimag.ibs.re.kr/event/2020-11-24/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20201130T170000
DTEND;TZID=Asia/Seoul:20201130T180000
DTSTAMP:20260419T164436
CREATED:20201126T022202Z
LAST-MODIFIED:20240707T082346Z
UID:3307-1606755600-1606759200@dimag.ibs.re.kr
SUMMARY:Joonkyung Lee (이준경)\, On Ramsey multiplicity
DESCRIPTION:Ramsey’s theorem states that\, for a fixed graph $H$\, every 2-edge-colouring of $K_n$ contains a monochromatic copy of $H$ whenever $n$ is large enough. Perhaps one of the most natural questions after Ramsey’s theorem is then how many copies of monochromatic $H$ can be guaranteed to exist. To formalise this question\, let the Ramsey multiplicity $M(H;n)$ be the minimum number of labelled copies of monochromatic $H$ over all 2-edge-colouring of $K_n$. We define the Ramsey multiplicity constant $C(H)$ is defined by $C(H):=\lim_{n\rightarrow\infty}\frac{M(H\,n)}{n(n-1)\cdots(n-v+1)}$. I will discuss various bounds for C(H) that are known so far.
URL:https://dimag.ibs.re.kr/event/2020-11-30/
LOCATION:Zoom ID:8628398170 (123450)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR