BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Casey Tompkins (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200414T073000Z
DTEND;VALUE=DATE-TIME:20200414T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/1
DESCRIPTION:Title: Saturation problems in the Ramsey theory of graphs\, posets
and point sets\nby Casey Tompkins (IBS Discrete Mathematics Group) as
part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract\nIn 1964\, Erdős\,
Hajnal and Moon introduced a saturation version of Turán's classical theo
rem in extremal graph theory. In particular\, they determined the minimum
number of edges in a $K_r$-free\, $n$-vertex graph with the property that
the addition of any further edge yields a copy of $K_r$. We consider analo
gues of this problem in other settings. We prove a saturation version of t
he Erdős-Szekeres theorem about monotone subsequences and saturation vers
ions of some Ramsey-type theorems on graphs and Dilworth-type theorems on
posets. \n\nWe also consider semisaturation problems\, wherein we allow
the family to have the forbidden configuration\, but insist that any addit
ion to the family yields a new copy of the forbidden configuration. In th
is setting\, we prove a semisaturation version of the Erdős-Szekeres theo
rem on convex $k$-gons\, as well as multiple semisaturation theorems for s
equences and posets.\n\nThis project was joint work with Gábor Damásdi\,
Balázs Keszegh\, David Malec\, Zhiyu Wang and Oscar Zamora.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sang-il Oum (IBS Discrete Mathematics Group and KAIST)
DTSTART;VALUE=DATE-TIME:20200421T073000Z
DTEND;VALUE=DATE-TIME:20200421T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/2
DESCRIPTION:Title: Survey on vertex-minors\nby Sang-il Oum (IBS Discrete Ma
thematics Group and KAIST) as part of IBS/KAIST Discrete Math Seminar\n\n\
nAbstract\nFor a vertex v of a graph G\, the local complementation at v is
an operation to obtain a new graph denoted by G*v from G such that two di
stinct vertices x\, y are adjacent in G*v if and only if both x\, y are ne
ighbors of v and x\, y are non-adjacent\, or at least one of x\, y is not
a neighbor of v and x\, y are adjacent. A graph H is a vertex-minor of a g
raph G if H is obtained from G by a sequence of local complementation and
vertex deletions. Interestingly vertex-minors have been used in the study
of measurement-based quantum computing on graph states.\nMotivated by the
big success of the graph minor structure theory developed deeply by Robert
son and Seymour since 1980s\, we propose a similar theory for vertex-minor
s. This talk will illustrate similarities between graph minors and graph v
ertex-minors and give a survey of known theorems and open problems on vert
ex-minors of graphs\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eun Jung Kim (CNRS\, LAMSADE)
DTSTART;VALUE=DATE-TIME:20200512T073000Z
DTEND;VALUE=DATE-TIME:20200512T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/3
DESCRIPTION:Title: Twin-width: tractable FO model checking\nby Eun Jung Kim
(CNRS\, LAMSADE) as part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract
\nInspired by a width invariant defined on permutations by Guillemot and M
arx [SODA '14]\, we introduce the notion of twin-width on graphs and on ma
trices. Proper minor-closed classes\, bounded rank-width graphs\, map gra
phs\, $K_t$-free unit $d$-dimensional ball graphs\, posets with antichains
of bounded size\, and proper subclasses of dimension-2 posets all have bo
unded twin-width. On all these classes (except map graphs without geometr
ic embedding) we show how to compute in polynomial time a sequence of $d$-
contractions\, witness that the twin-width is at most $d$. We show that F
O model checking\, that is deciding if a given first-order formula $\\phi$
evaluates to true for a given binary structure $G$ on a domain $D$\, is F
PT in $|\\phi|$ on classes of bounded twin-width\, provided the witness is
given. More precisely\, being given a $d$-contraction sequence for $G$\,
our algorithm runs in time $f(d\,|\\phi|) \\cdot |D|$ where $f$ is a comp
utable but non-elementary function. We also prove that bounded twin-width
is preserved by FO interpretations and transductions (allowing operations
such as squaring or complementing a graph). This unifies and significant
ly extends the knowledge on fixed-parameter tractability of FO model check
ing on non-monotone classes\, such as the FPT algorithm on bounded-width p
osets by Gajarský et al. [FOCS '15].\n\n\nIn order to explore the limits
of twin-width\, we generalize to bounded twin-width classes a result by N
orine et al. [JCTB '06] stating that proper minor-free classes are small (
i.e.\, they contain at most $n! c^n$ graphs on $n$ vertices\, for some con
stant $c$). This implies by a counting argument that bounded-degree graph
s\, interval graphs\, and unit disk graphs have unbounded twin-width.\n\nJ
oint work with Stéphan Thomassé\, Édouard Bonnet\, and Rémi Watrigant.
\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seunghun Lee (KAIST)
DTSTART;VALUE=DATE-TIME:20200428T073000Z
DTEND;VALUE=DATE-TIME:20200428T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/4
DESCRIPTION:Title: Leray numbers of complexes of graphs with bounded matching n
umber\nby Seunghun Lee (KAIST) as part of IBS/KAIST Discrete Math Semi
nar\n\n\nAbstract\nGiven a graph $G$ on the vertex set $V$\, the non-match
ing complex of $G$\, $\\mathsf{NM}_k(G)$\, is the family of subgraphs $G'
\\subset G$ whose matching number $\\nu(G')$ is strictly less than $k$. As
an attempt to generalize the result by Linusson\, Shareshian and Welker o
n the homotopy types of $\\mathsf{NM}_k(K_n)$ and $\\mathsf{NM}_k(K_{r\,s}
)$ to arbitrary graphs $G$\, we show that (i) $\\mathsf{NM}_k(G)$ is $(3k-
3)$-Leray\, and (ii) if $G$ is bipartite\, then $\\mathsf{NM}_k(G)$ is $(2
k-2)$-Leray. This result is obtained by analyzing the homology of the link
s of non-empty faces of the complex $\\mathsf{NM}_k(G)$\, which vanishes i
n all dimensions $d\\geq 3k-4$\, and all dimensions $d \\geq 2k-3$ when $G
$ is bipartite. As a corollary\, we have the following rainbow matching th
eorem which generalizes the result by Aharoni et. al. and Drisko's theorem
: Let $E_1\, \\dots\, E_{3k-2}$ be non-empty edge subsets of a graph and s
uppose that $\\nu(E_i\\cup E_j)\\geq k$ for every $i\\ne j$. Then $E=\\big
cup E_i$ has a rainbow matching of size $k$. Furthermore\, the number of e
dge sets $E_i$ can be reduced to $2k-1$ when $E$ is the edge set of a bipa
rtite graph.\n\nThis is a joint work with Andreas Holmsen.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:O-joung Kwon (Incheon National University)
DTSTART;VALUE=DATE-TIME:20200519T073000Z
DTEND;VALUE=DATE-TIME:20200519T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/5
DESCRIPTION:Title: Mim-width: a width parameter beyond rank-width\nby O-jou
ng Kwon (Incheon National University) as part of IBS/KAIST Discrete Math S
eminar\n\n\nAbstract\nVatshelle (2012) introduced a width parameter called
mim-width. It is based on the following cut function : for a vertex parti
tion (A\,B) of a graph\, the complexity of this partition is computed by t
he size of a maximum induced matching of the bipartite subgraph induced by
edges between A and B. This parameter naturally extends the expressibilit
y power of the graph parameters clique-width and rank-width\, which have b
een well-developed in recent years. In a series of papers\, we explored th
e computational complexity of several problems\, parameterized by mim-widt
h. We summarize known structural properties and algorithmic applications o
f mim-width\, and give some open problems at the end. This is joint work w
ith Lars Jaffke\, Torstein Strømme\, and Jan Arne Telle.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hong Liu (University of Warwick)
DTSTART;VALUE=DATE-TIME:20200526T073000Z
DTEND;VALUE=DATE-TIME:20200526T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/6
DESCRIPTION:Title: Asymptotic structure for the clique density theorem\nby
Hong Liu (University of Warwick) as part of IBS/KAIST Discrete Math Semina
r\n\n\nAbstract\nThe famous Erdős-Rademacher problem asks for the smalles
t number of r-cliques in a graph with the given number of vertices and edg
es. Despite decades of active attempts\, the asymptotic value of this extr
emal function for all r was determined only recently\, by Reiher [Annals o
f Mathematics\, 184 (2016) 683-707]. Here we describe the asymptotic struc
ture of all almost extremal graphs. This task for r=3 was previously accom
plished by Pikhurko and Razborov [Combinatorics\, Probability and Computin
g\, 26 (2017) 138–160].\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Huy-Tung Nguyen (KAIST)
DTSTART;VALUE=DATE-TIME:20200602T073000Z
DTEND;VALUE=DATE-TIME:20200602T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/7
DESCRIPTION:Title: The average cut-rank of graphs\nby Huy-Tung Nguyen (KAIS
T) as part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract\nThe cut-rank
of a set X of vertices in a graph G is defined as the rank of the X×(V(G)
∖X) matrix over the binary field whose (i\,j)-entry is 1 if the vertex i
in X is adjacent to the vertex j in V(G)∖X and 0 otherwise. We introduc
e the graph parameter called the average cut-rank of a graph\, defined as
the expected value of the cut-rank of a random set of vertices. We show th
at this parameter does not increase when taking vertex-minors of graphs an
d a class of graphs has bounded average cut-rank if and only if it has bou
nded neighborhood diversity. This allows us to deduce that for each real
α\, the list of induced-subgraph-minimal graphs having average cut-rank l
arger than (or at least) α is finite. We further refine this by providing
an upper bound on the size of obstruction and a lower bound on the number
of obstructions for average cut-rank at most (or smaller than) α for eac
h real α≥0. Finally\, we describe explicitly all graphs of average cut-
rank at most 3/2 and determine up to 3/2 all possible values that can be r
ealized as the average cut-rank of some graph. This is joint work with San
g-il Oum.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jiseung Kim (KIAS)
DTSTART;VALUE=DATE-TIME:20200609T073000Z
DTEND;VALUE=DATE-TIME:20200609T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/8
DESCRIPTION:Title: Hardness and concrete security in cryptography\nby Jiseu
ng Kim (KIAS) as part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract\nCo
mputationally hard problems have been widely used to construct cryptograph
ic primitives such as encryptions\, digital signatures. For example\, prov
ably secure primitives are based on a reduction from the hardness problems
. However\, the concrete instantiation of primitives does not follow the r
esults of hardness problems due to its efficiency. In this talk\, we intro
duce cryptographic hardness problems widely used in cryptography and the g
ap between hardness results and concrete security of cryptographic primiti
ves based on our recent works.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andreas Holmsen (KAIST)
DTSTART;VALUE=DATE-TIME:20200616T073000Z
DTEND;VALUE=DATE-TIME:20200616T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/9
DESCRIPTION:Title: Fractional Helly and topological complexity\nby Andreas
Holmsen (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract\n
The fractional Helly theorem is a simple yet remarkable generalization of
Helly’s classical theorem on the intersection of convex sets\, and it is
of considerable interest to extend the fractional Helly theorem beyond th
e setting of convexity. In this talk I will discuss a recent result which
shows that the fractional Helly theorem holds for families of subsets of $
\\mathbb R^d$\nwhich satisfy only very weak topological assumptions. The p
roofs combine a number of tools such as homological minors\, stair-convexi
ty\, supersaturation in hypergraphs\, Radon dimension\, and Ramsey-type ar
guments. This is joint work with Xavier Goaoc and Zuzana Patáková.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaehoon Kim (KAIST)
DTSTART;VALUE=DATE-TIME:20200623T073000Z
DTEND;VALUE=DATE-TIME:20200623T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/10
DESCRIPTION:Title: A resilience version of Pósa’s theorem\nby Jaehoon K
im (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seog-Jin Kim (Konkuk University)
DTSTART;VALUE=DATE-TIME:20200707T073000Z
DTEND;VALUE=DATE-TIME:20200707T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/11
DESCRIPTION:Title: Online DP-coloring of graphs\nby Seog-Jin Kim (Konkuk U
niversity) as part of IBS/KAIST Discrete Math Seminar\n\n\nAbstract\nOnlin
e list coloring and DP-coloring are generalizations of list coloring that
attracted considerable attention recently. Each of the paint number\, $\\c
hi_P(G)$\, (the minimum number of colors needed for an online coloring of
$G$) and the DP-chromatic number\, $\\chi_{DP}(G)$\, (the minimum number o
f colors needed for a DP-coloring of $G$) is at least the list chromatic n
umber\, $\\chi_\\ell(G)$\, of $G$ and can be much larger. On the other han
d\, each of them has a number of useful properties.\nWe introduce a common
generalization\, online DP-coloring\, of online list coloring and DP-colo
ring and to study its properties. This is joint work with Alexandr Kostochka\, Xuer Li\,
and Xuding Zhu.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ilkyoo Choi (Hankuk University of Foreign Studies)
DTSTART;VALUE=DATE-TIME:20200721T073000Z
DTEND;VALUE=DATE-TIME:20200721T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/12
DESCRIPTION:Title: Flexibility of Planar Graphs\nby Ilkyoo Choi (Hankuk Un
iversity of Foreign Studies) as part of IBS/KAIST Discrete Math Seminar\n\
n\nAbstract\nOftentimes in chromatic graph theory\, precoloring techniques
are utilized in order to obtain the desired coloring result. For example
\, Thomassen's proof for 5-choosability of planar graphs actually shows th
at two adjacent vertices on the same face can be precolored. In this vein
\, we investigate a precoloring extension problem formalized by Dvorak\, N
orin\, and Postle named *flexibility*. Given a list assignment $L$
on a graph $G$\, an $L$*-request* is a function on a subset $S$ of
the vertices that indicates a preferred color in $L(v)$ for each vertex $
v\\in S$. A graph $G$ is $\\varepsilon$*-flexible for list size* $
k$ if given a $k$-list assignment $L$ and an $L$-request\, there is an $L$
-coloring of $G$ satisfying an $\\varepsilon$-fraction of the requests in
$S$. We survey known results regarding this new concept\, and prove some
new results regarding flexibility of planar graphs.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dennis Wong (SUNY Korea)
DTSTART;VALUE=DATE-TIME:20200630T073000Z
DTEND;VALUE=DATE-TIME:20200630T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/14
DESCRIPTION:Title: Generating Gray codes and universal cycles for weak orders<
/a>\nby Dennis Wong (SUNY Korea) as part of IBS/KAIST Discrete Math Semina
r\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Casey Tompkins (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200714T073000Z
DTEND;VALUE=DATE-TIME:20200714T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/15
DESCRIPTION:Title: Inverse Turán problems\nby Casey Tompkins (IBS Discret
e Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLecture
held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eun Jung Kim (CNRS)
DTSTART;VALUE=DATE-TIME:20200728T073000Z
DTEND;VALUE=DATE-TIME:20200728T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/16
DESCRIPTION:Title: Solving hard cut problems via flow-augmentation\nby Eun
Jung Kim (CNRS) as part of IBS/KAIST Discrete Math Seminar\n\nLecture hel
d in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:June Huh (IAS)
DTSTART;VALUE=DATE-TIME:20200804T073000Z
DTEND;VALUE=DATE-TIME:20200804T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/17
DESCRIPTION:Title: Kazhdan-Lusztig polynomials of graphs and matroids\nby
June Huh (IAS) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held
in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yunbum Kook (KAIST)
DTSTART;VALUE=DATE-TIME:20200811T073000Z
DTEND;VALUE=DATE-TIME:20200811T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/18
DESCRIPTION:Title: Vertex Sparsification for Edge Connectivity\nby Yunbum
Kook (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in
Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Tran (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200818T073000Z
DTEND;VALUE=DATE-TIME:20200818T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/19
DESCRIPTION:Title: Anti-concentration phenomena\nby Tuan Tran (IBS Discret
e Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLecture
held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Lund (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200825T073000Z
DTEND;VALUE=DATE-TIME:20200825T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/20
DESCRIPTION:Title: Point-plane incidence bounds\nby Ben Lund (IBS Discrete
Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLecture
held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rutger Campbell (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200908T073000Z
DTEND;VALUE=DATE-TIME:20200908T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/21
DESCRIPTION:Title: Disasters in abstracting combinatorial properties of linear
dependence\nby Rutger Campbell (IBS Discrete Mathematics Group) as pa
rt of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\
nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Debsoumya Chakraborti (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200915T073000Z
DTEND;VALUE=DATE-TIME:20200915T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/22
DESCRIPTION:Title: Maximum number of cliques in a graph with bounded maximum d
egree\nby Debsoumya Chakraborti (IBS Discrete Mathematics Group) as pa
rt of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\
nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinha Kim (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200922T073000Z
DTEND;VALUE=DATE-TIME:20200922T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/23
DESCRIPTION:Title: Collapsibility of Non-Cover Complexes of Graphs\nby Jin
ha Kim (IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math
Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Minki Kim (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20200929T073000Z
DTEND;VALUE=DATE-TIME:20200929T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/25
DESCRIPTION:Title: Complexes of graphs with bounded independence number\nb
y Minki Kim (IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete
Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Joonkyung Lee (University College London)
DTSTART;VALUE=DATE-TIME:20201021T073000Z
DTEND;VALUE=DATE-TIME:20201021T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/26
DESCRIPTION:Title: On graph norms for complex-valued functions\nby Joonkyu
ng Lee (University College London) as part of IBS/KAIST Discrete Math Semi
nar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeong Ok Choi (GIST)
DTSTART;VALUE=DATE-TIME:20201027T073000Z
DTEND;VALUE=DATE-TIME:20201027T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/27
DESCRIPTION:Title: Various game-theoretic models on graphs\nby Jeong Ok Ch
oi (GIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Ro
om B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaeseong Oh (Seoul National University)
DTSTART;VALUE=DATE-TIME:20201103T073000Z
DTEND;VALUE=DATE-TIME:20201103T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/28
DESCRIPTION:Title: A 2-isomorphism theorem for delta-matroids\nby Jaeseong
Oh (Seoul National University) as part of IBS/KAIST Discrete Math Seminar
\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Casey Tompkins (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20201110T073000Z
DTEND;VALUE=DATE-TIME:20201110T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/29
DESCRIPTION:Title: Extremal forbidden poset problems in Boolean and linear lat
tices\nby Casey Tompkins (IBS Discrete Mathematics Group) as part of I
BS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstra
ct: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Duksang Lee (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20201124T073000Z
DTEND;VALUE=DATE-TIME:20201124T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/30
DESCRIPTION:Title: Characterizing matroids whose bases form graphic delta-matr
oids\nby Duksang Lee (IBS Discrete Mathematics Group / KAIST) as part
of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\n\n
Abstract\nWe introduce delta-graphic matroids\, which are matroids whose b
ases form graphic delta-matroids. The class of delta-graphic matroids cont
ains graphic matroids as well as cographic matroids and is a proper subcla
ss 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. Th
is is joint work with Sang-il Oum.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Debsoumya Chakraborti (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20201201T073000Z
DTEND;VALUE=DATE-TIME:20201201T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/31
DESCRIPTION:Title: Rainbow matchings in edge-colored simple graphs\nby Deb
soumya Chakraborti (IBS Discrete Mathematics Group / KAIST) as part of IBS
/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\n\nAbstra
ct\nThere has been much research on finding a large rainbow matching in a
properly edge-colored graph\, where a proper edge coloring is a coloring o
f the edge set such that no same-colored edges are incident. Barát\, Gyá
rfás\, and Sárközy conjectured that in every proper edge coloring of a
multigraph (with parallel edges allowed\, but not loops) with $2q$ colors
where each color appears at least $q$ times\, there is always a rainbow ma
tching of size $q$. We prove that $2q + o(q)$ colors are enough if the gra
ph is simple\, confirming the conjecture asymptotically for simple graphs.
We also make progress in the lower bound on the required number of colors
for simple graphs\, which disproves a conjecture of Aharoni and Berger. W
e use a randomized algorithm to obtain a large rainbow matching\, and the
analysis of the algorithm is based on differential equations method. We wi
ll also briefly comment on the limitations of using our probabilistic appr
oach for the problem. This talk will be based on a joint work with Po-Shen
Loh.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hong Liu (University of Warwick)
DTSTART;VALUE=DATE-TIME:20201208T073000Z
DTEND;VALUE=DATE-TIME:20201208T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/32
DESCRIPTION:Title: A solution to Erdős and Hajnal’s odd cycle problem\n
by Hong Liu (University of Warwick) as part of IBS/KAIST Discrete Math Sem
inar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:O-joung Kwon (Incheon National University / IBS Discrete Mathemati
cs Group)
DTSTART;VALUE=DATE-TIME:20210105T073000Z
DTEND;VALUE=DATE-TIME:20210105T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/34
DESCRIPTION:Title: Directed tangles and applications\nby O-joung Kwon (Inc
heon National University / IBS Discrete Mathematics Group) as part of IBS/
KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinha Kim (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20201222T073000Z
DTEND;VALUE=DATE-TIME:20201222T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/35
DESCRIPTION:Title: On a conjecture by Kalai and Meshulam – the Betti number
of the independence complex of ternary graphs\nby Jinha Kim (IBS Discr
ete Mathematics Group / KAIST) as part of IBS/KAIST Discrete Math Seminar\
n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andreas Holmsen (KAIST)
DTSTART;VALUE=DATE-TIME:20210112T073000Z
DTEND;VALUE=DATE-TIME:20210112T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/36
DESCRIPTION:Title: Discrete geometry in convexity spaces\nby Andreas Holms
en (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in R
oom B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/36/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Lund (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210119T073000Z
DTEND;VALUE=DATE-TIME:20210119T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/37
DESCRIPTION:Title: Perfect matchings and derangements on graphs\nby Ben Lu
nd (IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Sem
inar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Tran (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210126T073000Z
DTEND;VALUE=DATE-TIME:20210126T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/38
DESCRIPTION:Title: Minimum saturated families of sets\nby Tuan Tran (IBS D
iscrete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nL
ecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Doowon Koh (Chungbuk National University)
DTSTART;VALUE=DATE-TIME:20210209T073000Z
DTEND;VALUE=DATE-TIME:20210209T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/39
DESCRIPTION:Title: On the cone restriction conjecture in four dimensions and a
pplications in incidence geometry\nby Doowon Koh (Chungbuk National Un
iversity) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Ro
om B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/39/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kevin Hendrey (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210302T073000Z
DTEND;VALUE=DATE-TIME:20210302T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/40
DESCRIPTION:Title: A unified half-integral Erdős-Pósa theorem for cycles in
graphs labelled by multiple abelian groups\nby Kevin Hendrey (IBS Disc
rete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLect
ure held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/40/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Debsoumya Chakraborti (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210309T073000Z
DTEND;VALUE=DATE-TIME:20210309T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/41
DESCRIPTION:Title: Some classical problems in graph saturation\nby Debsoum
ya Chakraborti (IBS Discrete Mathematics Group) as part of IBS/KAIST Discr
ete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/41/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Se-Young Yun (KAIST)
DTSTART;VALUE=DATE-TIME:20210316T073000Z
DTEND;VALUE=DATE-TIME:20210316T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/42
DESCRIPTION:Title: Regret in Online Recommendation Systems\nby Se-Young Yu
n (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Ro
om B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/42/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hong Liu (University of Warwick)
DTSTART;VALUE=DATE-TIME:20210322T073000Z
DTEND;VALUE=DATE-TIME:20210322T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/43
DESCRIPTION:Title: Nested cycles with no geometric crossing\nby Hong Liu (
University of Warwick) as part of IBS/KAIST Discrete Math Seminar\n\nLectu
re held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/43/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Casey Tompkins (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210330T073000Z
DTEND;VALUE=DATE-TIME:20210330T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/44
DESCRIPTION:Title: 3-uniform hypergraphs avoiding a cycle of length four\n
by Casey Tompkins (IBS Discrete Mathematics Group) as part of IBS/KAIST Di
screte Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/44/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rutger Campbell (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20210406T073000Z
DTEND;VALUE=DATE-TIME:20210406T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/45
DESCRIPTION:by Rutger Campbell (IBS Discrete Mathematics Group / KAIST) as
part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IB
S.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/45/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sang-il Oum (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20210420T073000Z
DTEND;VALUE=DATE-TIME:20210420T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/46
DESCRIPTION:Title: What is an isotropic system?\nby Sang-il Oum (IBS Discr
ete Mathematics Group / KAIST) as part of IBS/KAIST Discrete Math Seminar\
n\nLecture held in Room B232\, IBS.\n\nAbstract\nBouchet introduced isotro
pic systems in 1983 unifying some combinatorial features of binary matroid
s and 4-regular graphs. The concept of isotropic system is a useful tool t
o study vertex-minors of graphs and yet it is not well known. I will give
an introduction to isotropic systems.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/46/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jungho Ahn (KAIST & IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210427T073000Z
DTEND;VALUE=DATE-TIME:20210427T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/47
DESCRIPTION:Title: Well-partitioned chordal graphs with the obstruction set an
d applications\nby Jungho Ahn (KAIST & IBS Discrete Mathematics Group)
as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\,
IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/47/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mark Siggers (Kyungpook National University)
DTSTART;VALUE=DATE-TIME:20210511T073000Z
DTEND;VALUE=DATE-TIME:20210511T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/49
DESCRIPTION:Title: The list switch homomorphism problem for signed graphs\
nby Mark Siggers (Kyungpook National University) as part of IBS/KAIST Disc
rete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/49/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pascal Gollin (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20210518T073000Z
DTEND;VALUE=DATE-TIME:20210518T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/50
DESCRIPTION:by Pascal Gollin (IBS Discrete Mathematics Group / KAIST) as p
art of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.
\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/50/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hongseok Yang (KAIST)
DTSTART;VALUE=DATE-TIME:20210622T073000Z
DTEND;VALUE=DATE-TIME:20210622T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/51
DESCRIPTION:Title: DAG-symmetries and Symmetry-Preserving Neural Networks\
nby Hongseok Yang (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLe
cture held in Room B232\, IBS.\n\nAbstract\nThe preservation of symmetry i
s one of the key tools for designing data-efficient neural networks. A rep
resentative example is convolutional neural networks (CNNs)\; they preserv
e translation symmetries\, and this symmetry preservation is often attribu
ted to their success in real-world applications. In the machine-learning c
ommunity\, there is a growing body of work that explores a new type of sym
metries\, both discrete and continuous\, and studies neural networks that
preserve those symmetries.\n\nIn this talk\, I will explain what I call DA
G-symmetries and our preliminary results on the shape of neural networks t
hat preserve these symmetries. DAG-symmetries are finite variants of DAG-e
xchangeability developed by Jung\, Lee\, Staton\, and Yang (2020) in the c
ontext of probabilistic symmetries. Using these symmetries\, we can expres
s that when a neural network works on\, for instance\, sets of bipartite g
raphs whose edges are labelled with reals\, the network depends on neither
the order of elements in the set nor the identities of vertices of the gr
aphs. I will explain how a group of specific DAG-symmetries is constructed
by applying a form of wreath product over a given finite DAG. Then\, I wi
ll explain what linear layers of neural networks preserving these symmetri
es should look like.\n\nThis is joint work with Dongwoo Oh.\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/51/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Doowon Koh (Chungbuk National University)
DTSTART;VALUE=DATE-TIME:20210601T073000Z
DTEND;VALUE=DATE-TIME:20210601T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/52
DESCRIPTION:Title: Mattila-Sjölin type functions: A finite field model\nb
y Doowon Koh (Chungbuk National University) as part of IBS/KAIST Discrete
Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/52/
END:VEVENT
BEGIN:VEVENT
SUMMARY:O-joung Kwon (Incheon National University & IBS DIMAG)
DTSTART;VALUE=DATE-TIME:20210608T060000Z
DTEND;VALUE=DATE-TIME:20210608T070000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/53
DESCRIPTION:Title: Classes of intersection digraphs with good algorithmic prop
erties\nby O-joung Kwon (Incheon National University & IBS DIMAG) as p
art of IBS/KAIST Discrete Math Seminar\n\nLecture held in Zoom.\nAbstract:
TBA\n\nIt is a part of the Round the World Relay in Combinatorics\, Tuesd
ay June 8\, 2021\nhttp://people.maths.ox.ac.uk/scott/relay.htm\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/53/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Suil O (SUNY Korea)
DTSTART;VALUE=DATE-TIME:20210706T073000Z
DTEND;VALUE=DATE-TIME:20210706T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/54
DESCRIPTION:Title: Eigenvalues and [a\, b]-factors in regular graphs\nby S
uil O (SUNY Korea) as part of IBS/KAIST Discrete Math Seminar\n\nLecture h
eld in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/54/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaehoon Kim (KAIST)
DTSTART;VALUE=DATE-TIME:20210713T073000Z
DTEND;VALUE=DATE-TIME:20210713T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/55
DESCRIPTION:Title: $K_{r+1}$-saturated graphs with small spectral radius\n
by Jaehoon Kim (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLectu
re held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/55/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Semin Yoo (KIAS)
DTSTART;VALUE=DATE-TIME:20210720T073000Z
DTEND;VALUE=DATE-TIME:20210720T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/57
DESCRIPTION:Title: Combinatorics of Euclidean spaces over finite fields\nb
y Semin Yoo (KIAS) as part of IBS/KAIST Discrete Math Seminar\n\nLecture h
eld in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/57/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Euiwoong Lee (University of Michigan)
DTSTART;VALUE=DATE-TIME:20210727T060000Z
DTEND;VALUE=DATE-TIME:20210727T070000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/58
DESCRIPTION:Title: The Karger-Stein algorithm is optimal for k-cut\nby Eui
woong Lee (University of Michigan) as part of IBS/KAIST Discrete Math Semi
nar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/58/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeong Ok Choi (GIST)
DTSTART;VALUE=DATE-TIME:20210629T073000Z
DTEND;VALUE=DATE-TIME:20210629T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/60
DESCRIPTION:Title: Invertibility of circulant matrices of arbitrary size\n
by Jeong Ok Choi (GIST) as part of IBS/KAIST Discrete Math Seminar\n\nLect
ure held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/60/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Linda Cook (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210817T073000Z
DTEND;VALUE=DATE-TIME:20210817T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/61
DESCRIPTION:Title: Two results on graphs with holes of restricted lengths\
nby Linda Cook (IBS Discrete Mathematics Group) as part of IBS/KAIST Discr
ete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/61/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eun Jung Kim (LAMSADE)
DTSTART;VALUE=DATE-TIME:20210824T073000Z
DTEND;VALUE=DATE-TIME:20210824T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/62
DESCRIPTION:Title: A Constant-factor Approximation for Weighted Bond Cover
\nby Eun Jung Kim (LAMSADE) as part of IBS/KAIST Discrete Math Seminar\n\n
Lecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/62/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dabeen Lee (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210907T073000Z
DTEND;VALUE=DATE-TIME:20210907T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/63
DESCRIPTION:Title: Mixing sets\, submodularity\, and chance-constrained optimi
zation\nby Dabeen Lee (IBS Discrete Mathematics Group) as part of IBS/
KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/63/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Duksang Lee (KAIST and IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210810T073000Z
DTEND;VALUE=DATE-TIME:20210810T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/64
DESCRIPTION:Title: Intertwining connectivities for vertex-minors and pivot-min
ors\nby Duksang Lee (KAIST and IBS Discrete Mathematics Group) as part
of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nA
bstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/64/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kevin Hendrey (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20210928T073000Z
DTEND;VALUE=DATE-TIME:20210928T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/65
DESCRIPTION:Title: Extremal functions for sparse minors\nby Kevin Hendrey
(IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Semina
r\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/65/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Joonkyung Lee (Hanyang University)
DTSTART;VALUE=DATE-TIME:20211012T073000Z
DTEND;VALUE=DATE-TIME:20211012T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/66
DESCRIPTION:Title: Majority dynamics on sparse random graphs\nby Joonkyung
Lee (Hanyang University) as part of IBS/KAIST Discrete Math Seminar\n\nLe
cture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/66/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cheolwon Heo (SKKU)
DTSTART;VALUE=DATE-TIME:20210831T073000Z
DTEND;VALUE=DATE-TIME:20210831T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/67
DESCRIPTION:by Cheolwon Heo (SKKU) as part of IBS/KAIST Discrete Math Semi
nar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/67/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eunjin Oh (POSTECH)
DTSTART;VALUE=DATE-TIME:20211005T073000Z
DTEND;VALUE=DATE-TIME:20211005T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/68
DESCRIPTION:Title: Feedback Vertex Set on Geometric Intersection Graphs\nb
y Eunjin Oh (POSTECH) as part of IBS/KAIST Discrete Math Seminar\n\nLectur
e held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/68/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Lund (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20211102T073000Z
DTEND;VALUE=DATE-TIME:20211102T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/69
DESCRIPTION:Title: Maximal 3-wise intersecting families\nby Ben Lund (IBS
Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\n
Lecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/69/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Donggyu Kim (KAIST and IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20211026T073000Z
DTEND;VALUE=DATE-TIME:20211026T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/70
DESCRIPTION:Title: 𝝘-graphic delta-matroids and their applications\nby
Donggyu Kim (KAIST and IBS Discrete Mathematics Group) as part of IBS/KAIS
T Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA
\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/70/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaehoon Kim (KAIST)
DTSTART;VALUE=DATE-TIME:20211109T073000Z
DTEND;VALUE=DATE-TIME:20211109T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/71
DESCRIPTION:Title: 2-complexes with unique embeddings in 3-space\nby Jaeho
on Kim (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held
in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/71/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Casey Tompkins (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20211123T073000Z
DTEND;VALUE=DATE-TIME:20211123T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/72
DESCRIPTION:Title: Ramsey numbers of Boolean lattices\nby Casey Tompkins (
IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar
\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/72/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eun-Kyung Cho (Hankuk University of Foreign Studies)
DTSTART;VALUE=DATE-TIME:20211207T073000Z
DTEND;VALUE=DATE-TIME:20211207T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/73
DESCRIPTION:Title: Independent domination of graphs with bounded maximum degre
e\nby Eun-Kyung Cho (Hankuk University of Foreign Studies) as part of
IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstr
act: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/73/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seonghyuk Im (KAIST)
DTSTART;VALUE=DATE-TIME:20211130T073000Z
DTEND;VALUE=DATE-TIME:20211130T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/74
DESCRIPTION:Title: Large clique subdivisions in graphs without small dense sub
graphs\nby Seonghyuk Im (KAIST) as part of IBS/KAIST Discrete Math Sem
inar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/74/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Tran (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20211214T073000Z
DTEND;VALUE=DATE-TIME:20211214T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/75
DESCRIPTION:Title: Exponential decay of intersection volume with applications
on list-decodability and sphere-covering bounds\nby Tuan Tran (IBS Dis
crete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLec
ture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/75/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seunghun Lee (Binghamton University)
DTSTART;VALUE=DATE-TIME:20220104T073000Z
DTEND;VALUE=DATE-TIME:20220104T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/76
DESCRIPTION:Title: Transversals and colorings of simplicial spheres\nby Se
unghun Lee (Binghamton University) as part of IBS/KAIST Discrete Math Semi
nar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/76/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andreas Holmsen (KAIST)
DTSTART;VALUE=DATE-TIME:20220111T073000Z
DTEND;VALUE=DATE-TIME:20220111T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/77
DESCRIPTION:Title: Some recent results on geometric transversals\nby Andre
as Holmsen (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture h
eld in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/77/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaehyeon Seo (KAIST)
DTSTART;VALUE=DATE-TIME:20220118T073000Z
DTEND;VALUE=DATE-TIME:20220118T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/78
DESCRIPTION:by Jaehyeon Seo (KAIST) as part of IBS/KAIST Discrete Math Sem
inar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/78/
END:VEVENT
BEGIN:VEVENT
SUMMARY:O-joung Kwon (Incheon National University / IBS Discrete Mathemati
cs Group)
DTSTART;VALUE=DATE-TIME:20220125T073000Z
DTEND;VALUE=DATE-TIME:20220125T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/79
DESCRIPTION:Title: Reduced bandwidth: a qualitative strengthening of twin-widt
h in minor-closed classes (and beyond)\nby O-joung Kwon (Incheon Natio
nal University / IBS Discrete Mathematics Group) as part of IBS/KAIST Disc
rete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/79/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinha Kim (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220215T073000Z
DTEND;VALUE=DATE-TIME:20220215T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/80
DESCRIPTION:Title: Independent domination of graphs with bounded maximum degre
e\nby Jinha Kim (IBS Discrete Mathematics Group) as part of IBS/KAIST
Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/80/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Donggyu Kim (IBS Discrete Mathematics Group / KAIST)
DTSTART;VALUE=DATE-TIME:20220221T073000Z
DTEND;VALUE=DATE-TIME:20220221T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/81
DESCRIPTION:Title: A stronger version of Tutte’s wheel theorem for vertex-mi
nors\nby Donggyu Kim (IBS Discrete Mathematics Group / KAIST) as part
of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAb
stract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/81/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuan Anh Do (IBS Discrete Mathematics Group / TU Graz)
DTSTART;VALUE=DATE-TIME:20220314T073000Z
DTEND;VALUE=DATE-TIME:20220314T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/82
DESCRIPTION:Title: Rank- and tree-width of supercritical random graphs\nby
Tuan Anh Do (IBS Discrete Mathematics Group / TU Graz) as part of IBS/KAI
ST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TB
A\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/82/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jaehoon Kim (KAIST)
DTSTART;VALUE=DATE-TIME:20220321T073000Z
DTEND;VALUE=DATE-TIME:20220321T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/84
DESCRIPTION:Title: Ramsey numbers of cycles versus general graphs\nby Jaeh
oon Kim (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held
in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/84/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Younjin Kim (POSTECH)
DTSTART;VALUE=DATE-TIME:20220411T073000Z
DTEND;VALUE=DATE-TIME:20220411T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/85
DESCRIPTION:Title: On the extremal problems related to Szemerédi’s theorem<
/a>\nby Younjin Kim (POSTECH) as part of IBS/KAIST Discrete Math Seminar\n
\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/85/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Boram Park (Ajou University)
DTSTART;VALUE=DATE-TIME:20220425T073000Z
DTEND;VALUE=DATE-TIME:20220425T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/86
DESCRIPTION:Title: Odd coloring of sparse graphs\nby Boram Park (Ajou Univ
ersity) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room
B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/86/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Lund (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220328T073000Z
DTEND;VALUE=DATE-TIME:20220328T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/87
DESCRIPTION:Title: Thresholds for incidence properties in finite vector spaces
\nby Ben Lund (IBS Discrete Mathematics Group) as part of IBS/KAIST Di
screte Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/87/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cheolwon Heo (SKKU)
DTSTART;VALUE=DATE-TIME:20220502T073000Z
DTEND;VALUE=DATE-TIME:20220502T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/88
DESCRIPTION:Title: The complexity of the matroid-homomorphism problems\nby
Cheolwon Heo (SKKU) as part of IBS/KAIST Discrete Math Seminar\n\nLecture
held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/88/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kyeongsik Nam (KAIST)
DTSTART;VALUE=DATE-TIME:20220509T073000Z
DTEND;VALUE=DATE-TIME:20220509T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/89
DESCRIPTION:Title: Large deviations for subgraph counts in random graphs\n
by Kyeongsik Nam (KAIST) as part of IBS/KAIST Discrete Math Seminar\n\nLec
ture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/89/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stijn Cambie (IBS ECOPRO)
DTSTART;VALUE=DATE-TIME:20220523T073000Z
DTEND;VALUE=DATE-TIME:20220523T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/90
DESCRIPTION:Title: The precise diameter of reconfiguration graphs\nby Stij
n Cambie (IBS ECOPRO) as part of IBS/KAIST Discrete Math Seminar\n\nLectur
e held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/90/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hongseok Yang (KAIST)
DTSTART;VALUE=DATE-TIME:20220530T073000Z
DTEND;VALUE=DATE-TIME:20220530T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/91
DESCRIPTION:by Hongseok Yang (KAIST) as part of IBS/KAIST Discrete Math Se
minar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/91/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andreas Holmsen (KAIST)
DTSTART;VALUE=DATE-TIME:20220516T073000Z
DTEND;VALUE=DATE-TIME:20220516T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/92
DESCRIPTION:Title: A colorful version of the Goodman-Pollack-Wenger transversa
l theorem\nby Andreas Holmsen (KAIST) as part of IBS/KAIST Discrete Ma
th Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/92/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amadeus Reinald (ENS de Lyon)
DTSTART;VALUE=DATE-TIME:20220613T073000Z
DTEND;VALUE=DATE-TIME:20220613T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/93
DESCRIPTION:Title: Twin-width and forbidden subdivisions\nby Amadeus Reina
ld (ENS de Lyon) as part of IBS/KAIST Discrete Math Seminar\n\nLecture hel
d in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/93/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Lund (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220627T073000Z
DTEND;VALUE=DATE-TIME:20220627T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/94
DESCRIPTION:Title: Radial projections in finite space\nby Ben Lund (IBS Di
screte Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLe
cture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/94/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eric Vigoda (UC Santa Barbara)
DTSTART;VALUE=DATE-TIME:20220704T073000Z
DTEND;VALUE=DATE-TIME:20220704T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/95
DESCRIPTION:Title: Computational phase transition and MCMC algorithms\nby
Eric Vigoda (UC Santa Barbara) as part of IBS/KAIST Discrete Math Seminar\
n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/95/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eun Jung Kim (LAMSADE\, CNRS)
DTSTART;VALUE=DATE-TIME:20220809T073000Z
DTEND;VALUE=DATE-TIME:20220809T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/96
DESCRIPTION:Title: Directed flow-augmentation\nby Eun Jung Kim (LAMSADE\,
CNRS) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B
232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/96/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seunghun Lee (Hebrew University of Jerusalem)
DTSTART;VALUE=DATE-TIME:20220801T073000Z
DTEND;VALUE=DATE-TIME:20220801T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/97
DESCRIPTION:Title: Inscribable order types\nby Seunghun Lee (Hebrew Univer
sity of Jerusalem) as part of IBS/KAIST Discrete Math Seminar\n\nLecture h
eld in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/97/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinyoung Park (Stanford University)
DTSTART;VALUE=DATE-TIME:20220718T073000Z
DTEND;VALUE=DATE-TIME:20220718T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/98
DESCRIPTION:Title: Thresholds 1/2\nby Jinyoung Park (Stanford University)
as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\,
IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/98/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jinyoung Park (Stanford University)
DTSTART;VALUE=DATE-TIME:20220719T050000Z
DTEND;VALUE=DATE-TIME:20220719T070000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/99
DESCRIPTION:Title: Thresholds 2/2\nby Jinyoung Park (Stanford University)
as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\,
IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/99/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kevin Hendrey (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220711T073000Z
DTEND;VALUE=DATE-TIME:20220711T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/100
DESCRIPTION:by Kevin Hendrey (IBS Discrete Mathematics Group) as part of I
BS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstra
ct: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/100/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noleen Köhler (LAMSADE\, CNRS)
DTSTART;VALUE=DATE-TIME:20220816T073000Z
DTEND;VALUE=DATE-TIME:20220816T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/101
DESCRIPTION:Title: Testing first-order definable properties on bounded degree
graphs\nby Noleen Köhler (LAMSADE\, CNRS) as part of IBS/KAIST Discr
ete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/101/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Raul Wayne Teixeira Lopes (LAMSADE\, CNRS)
DTSTART;VALUE=DATE-TIME:20220823T073000Z
DTEND;VALUE=DATE-TIME:20220823T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/102
DESCRIPTION:Title: Temporal Menger and related problems\nby Raul Wayne Te
ixeira Lopes (LAMSADE\, CNRS) as part of IBS/KAIST Discrete Math Seminar\n
\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/102/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sebastian Wiederrecht (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220913T073000Z
DTEND;VALUE=DATE-TIME:20220913T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/103
DESCRIPTION:Title: Killing a vortex\nby Sebastian Wiederrecht (IBS Discre
te Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\nLectur
e held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/103/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jun Gao (IBS Extremal Combinatorics and Probability Group)
DTSTART;VALUE=DATE-TIME:20220830T073000Z
DTEND;VALUE=DATE-TIME:20220830T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/104
DESCRIPTION:Title: Number of (k-1)-cliques in k-critical graph\nby Jun Ga
o (IBS Extremal Combinatorics and Probability Group) as part of IBS/KAIST
Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/104/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bjarne Schuelke (Caltech)
DTSTART;VALUE=DATE-TIME:20220906T073000Z
DTEND;VALUE=DATE-TIME:20220906T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/105
DESCRIPTION:Title: A local version of Katona’s intersection theorem\nby
Bjarne Schuelke (Caltech) as part of IBS/KAIST Discrete Math Seminar\n\nL
ecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/105/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexander Clifton (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20220927T073000Z
DTEND;VALUE=DATE-TIME:20220927T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/106
DESCRIPTION:Title: Ramsey Theory for Diffsequences\nby Alexander Clifton
(IBS Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Semina
r\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/106/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zixiang Xu (IBS Extremal Combinatorics and Probability Group)
DTSTART;VALUE=DATE-TIME:20221004T073000Z
DTEND;VALUE=DATE-TIME:20221004T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/107
DESCRIPTION:Title: On the degenerate Turán problems\nby Zixiang Xu (IBS
Extremal Combinatorics and Probability Group) as part of IBS/KAIST Discret
e Math Seminar\n\nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/107/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nika Salia (IBS Extremal Combinatorics and Probability Group)
DTSTART;VALUE=DATE-TIME:20221011T073000Z
DTEND;VALUE=DATE-TIME:20221011T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/108
DESCRIPTION:Title: Exact results for generalized extremal problems forbidding
an even cycle\nby Nika Salia (IBS Extremal Combinatorics and Probabil
ity Group) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in R
oom B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/108/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Florent Koechlin (LORIA\, INRIA\, Nancy\, France)
DTSTART;VALUE=DATE-TIME:20221018T073000Z
DTEND;VALUE=DATE-TIME:20221018T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/109
DESCRIPTION:by Florent Koechlin (LORIA\, INRIA\, Nancy\, France) as part o
f IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nAbs
tract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/109/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jungho Ahn (KAIST & IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20221108T073000Z
DTEND;VALUE=DATE-TIME:20221108T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/110
DESCRIPTION:Title: Unified almost linear kernels for generalized covering and
packing problems on nowhere dense classes\nby Jungho Ahn (KAIST & IBS
Discrete Mathematics Group) as part of IBS/KAIST Discrete Math Seminar\n\
nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/110/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sebastian Wiederrecht (IBS Discrete Mathematics Group)
DTSTART;VALUE=DATE-TIME:20221115T073000Z
DTEND;VALUE=DATE-TIME:20221115T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/111
DESCRIPTION:Title: Excluding single-crossing matching minors in bipartite gra
phs\nby Sebastian Wiederrecht (IBS Discrete Mathematics Group) as part
of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room B232\, IBS.\nA
bstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/111/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Seonghyuk Im (KAIST & IBS Extremal Combinatorics and Probability G
roup)
DTSTART;VALUE=DATE-TIME:20221122T073000Z
DTEND;VALUE=DATE-TIME:20221122T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/112
DESCRIPTION:Title: A proof of the Elliott-Rödl conjecture on hypertrees in S
teiner triple systems\nby Seonghyuk Im (KAIST & IBS Extremal Combinato
rics and Probability Group) as part of IBS/KAIST Discrete Math Seminar\n\n
Lecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/112/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Giannos Stamoulis (LIRMM)
DTSTART;VALUE=DATE-TIME:20221206T073000Z
DTEND;VALUE=DATE-TIME:20221206T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/113
DESCRIPTION:Title: Model-Checking for First-Order Logic with Disjoint Paths P
redicates in Proper Minor-Closed Graph Classes\nby Giannos Stamoulis (
LIRMM) as part of IBS/KAIST Discrete Math Seminar\n\nLecture held in Room
B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/113/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Youngho Yoo (Texas A&M Univ.)
DTSTART;VALUE=DATE-TIME:20230103T073000Z
DTEND;VALUE=DATE-TIME:20230103T083000Z
DTSTAMP;VALUE=DATE-TIME:20221209T220436Z
UID:discrete-math-seminar/114
DESCRIPTION:by Youngho Yoo (Texas A&M Univ.) as part of IBS/KAIST Discrete
Math Seminar\n\nView-only livestream: https://www.youtube.com/c/ibsdimag\
nLecture held in Room B232\, IBS.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/discrete-math-seminar/114/
URL:https://www.youtube.com/c/ibsdimag
END:VEVENT
END:VCALENDAR