Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors
Given a finite set of elements $V$ and a family $\mathcal{C}$ of subsets of $V$, the set covering problem is to find a minimum cardinality subset of $V$ intersecting every …
10 events found.
Events
-
-
Room B232 IBS (기초과학연구원)
-
2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures
Room B232 IBS (기초과학연구원)Schedule July 22 Monday 10:00-11:00 Introduction, 11:00-12:00 Open Problems July 23 Tuesday 10:00-10:30 Stefan Kratsch, Humboldt-Universität zu Berlin, Germany Elimination Distances, Blocking Sets, and Kernels for Vertex Cover 10:45-11:15 Benjamin Bergougnoux, …
-
-
2019-2 IBS One-Day Conference on Extremal Graph Theory
Room B232 IBS (기초과학연구원)Invited Speakers Jaehoon Kim (김재훈), KAIST Hong Liu (刘鸿), University of Warwick Abhishek Methuku, IBS Discrete Mathematics Group Péter Pál Pach, Budapest University of Technology and Economics Schedule August 12, …
-
2019 Combinatorics Workshop
Hotel Skypark, Songdo, Incheon, Korea (송도 스카이파크호텔)The annual conference on Combinatorics Workshop (조합론 학술대회) began in 2004 by the Yonsei University BK21 Research Group. This year it will take place in Songdo, Incheon, August 13-15, 2019. …
-
Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
Room B232 IBS (기초과학연구원)In this talk we shall discuss how quickly the genus of the Erdős-Rényi random graph grows as the number of edges increases and how dramatically a small number of random edges …
-
-
Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Room B232 IBS (기초과학연구원)Given a graph $G$, we define $\textrm{ex}_c(G)$ to be the minimum value of $t$ for which there exists a constant $N(t,G)$ such that every $t$-connected graph with at least $N(t,G)$ …
-
Cory Palmer, A survey of Turán-type subgraph counting problems
Room B232 IBS (기초과학연구원)Let $F$ and $H$ be graphs. The subgraph counting function $\operatorname{ex}(n,H,F)$ is defined as the maximum possible number of subgraphs $H$ in an $n$-vertex $F$-free graph. This function is a …
-
-
Casey Tompkins, Extremal problems for Berge hypergraphs
Room B232 IBS (기초과학연구원)Given a graph $G$, there are several natural hypergraph families one can define. Among the least restrictive is the family $BG$ of so-called Berge copies of the graph $G$. In …
-
Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs
Room 1501, Bldg. E6-1, KAISTA well-known Ramsey-type puzzle for children is to prove that among any 6 people either there are 3 who know each other or there are 3 who do not know each …
-
Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
Room B232 IBS (기초과학연구원)A graph or graph property is $\ell$-reconstructible if it is determined by the multiset of all subgraphs obtained by deleting $\ell$ vertices. Apart from the famous Graph Reconstruction Conjecture, Kelly conjectured in …
