### Yunbum Kook (국윤범), Vertex Sparsification for Edge Connectivity

Room B232 IBS (기초과학연구원)Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether $(1+\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. As a step towards this goal, we initiate the study of a thresholded version of the problem: for a given parameter $c$, …