Nika Salia, Exact results for generalized extremal problems forbidding an even cycle

Room B332 IBS (기초과학연구원)

We determine the maximum number of copies of $K_{s,s}$ in a $C_{2s+2}$-free $n$-vertex graph for all integers $s \ge 2$ and sufficiently large $n$. Moreover, for $s\in\{2,3\}$ and any integer $n$ we obtain the maximum number of cycles of length $2s$ in an $n$-vertex $C_{2s+2}$-free bipartite graph. This is joint work with Ervin Győri (Renyi

Xavier Goaoc, Order types and their symmetries

Room 1501, Bldg. E6-1, KAIST

Order types are a combinatorial classification of finite point sets used in discrete and computational geometry. This talk will give an introduction to these objects and their analogue for the projective plane, with an emphasis on their symmetry groups. This is joint work with Emo Welzl.

Florent Koechlin, Uniform random expressions lack expressivity

Room B332 IBS (기초과학연구원)

In computer science, random expressions are commonly used to analyze algorithms, either to study their average complexity, or to generate benchmarks to test them experimentally. In general, these approaches only consider the expressions as purely syntactic trees, and completely ignore their semantics — i.e. the mathematical object represented by the expression. However, two different expressions

Dabeen Lee (이다빈), Non-smooth and Hölder-smooth submodular optimization

Room 1501, Bldg. E6-1, KAIST

We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an guarantee when the function is monotone and Hölder-smooth, meaning that it admits a Hölder-continuous gradient. For functions that are non-differentiable or non-smooth, we propose a variant of the mirror-prox algorithm that

Jungho Ahn (안정호), Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Room B332 IBS (기초과학연구원)

Let $\mathcal{F}$ be a family of graphs, and let $p$ and $r$ be nonnegative integers. The $(p,r,\mathcal{F})$-Covering problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such that $G^p\setminus N_G^r$ has no induced subgraph isomorphic to a graph in $\mathcal{F}$, where

Hugo Jacob, On the parameterized complexity of computing tree-partitions

Zoom ID: 869 4632 6610 (ibsdimag)

Following some recent FPT algorithms parameterized by the width of a given tree-partition due to Bodlaender, Cornelissen, and van der Wegen, we consider the parameterized problem of computing a decomposition. We prove that computing an optimal tree-partition is XALP-complete, which is likely to exclude FPT algorithms. However, we prove that computing a tree-partition of approximate

Sebastian Wiederrecht, Excluding single-crossing matching minors in bipartite graphs

Room B332 IBS (기초과학연구원)

By a seminal result of Valiant, computing the permanent of (0, 1)-matrices is, in general, #P-hard. In 1913 Pólya asked for which (0, 1)-matrices A it is possible to change some signs such that the permanent of A equals the determinant of the resulting matrix. In 1975, Little showed these matrices to be exactly the

Chong Shangguan (上官冲), On the sparse hypergraph problem of Brown, Erdős and Sós

Zoom ID: 224 221 2686 (ibsecopro)

For fixed integers $r\ge 3, e\ge 3$, and $v\ge r+1$, let $f_r(n,v,e)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph in which the union of arbitrary $e$ distinct edges contains at least $v+1$ vertices. In 1973, Brown, Erdős and Sós initiated the study of the function $f_r(n,v,e)$ and they proved that $\Omega(n^{\frac{er-v}{e-1}})=f_r(n,v,e)=O(n^{\lceil\frac{er-v}{e-1}\rceil})$.

Seonghyuk Im (임성혁), A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

Room B332 IBS (기초과학연구원)

A linear $3$-graph is called a (3-)hypertree if there exists exactly one path between each pair of two distinct vertices.  A linear $3$-graph is called a Steiner triple system if each pair of two distinct vertices belong to a unique edge. A simple greedy algorithm shows that every $n$-vertex Steiner triple system $G$ contains all

The 2nd Workshop on Developments in Combinatorics

Zoom ID: 346 934 4087 (202209)

Official website (with the abstract) https://www.ibs.re.kr/ecopro/online-workshop-developments-in-combinatorics/ Invited Speakers Nov. 28 Monday Jie Han, Beijing Institute of Technology 15:30 Seoul, 14:30 Beijing, 06:30 UK, 07:30 EU Joonkyung Lee (이준경), Hanyang University 16:10 Seoul, 15:10 Beijing, 07:10 UK, 08:10 EU Lior Gishboliner, ETH Zürich 16:50 Seoul, 15:50 Beijing, 07:50 UK, 08:50 EU Alex Scott, University of Oxford

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.