기초과학연구원 이산수학그룹
The cycle double cover conjecture (CDC) claims that every graph without cut-edges has a list of cycles such that every edge appears exactly twice in the list. This conjecture was …
For $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_k) \in {\mathbb F}_2^k$, an $\boldsymbol{\alpha} $-town is a set family in which every $i$-wise intersection has parity $\alpha_i$. Denote by $f_{\boldsymbol{\alpha} }(n)$ the maximum …
Website: https://kscw.combinatorics.kr/
The 2026 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be …
Combinatorics Workshop (조합론 학술대회) is an annual conference for researchers in combinatorics and related areas in Korea. It was started in 2004 by the Yonsei University BK21 Research Group. Since …