(June 5) Seonghyuk Im, Ramsey-Dirac Theory
(June 3) Seokbeom Kim, Rank-width and vertex-minors
(May 1) Mujin Choi, Coarse graph theory
(Apr 24) Jaehyeon Seo, Log-concavity and the combinatorial atlas
(Mar 6) Dohyeon Lee, Introduction to Discrete Morse Theory
(Jan 16, 17) Hyunwoo Lee and Seonghyuk Im, Finding spanning structures
(Jan 13) Donggyu Kim, Chip firing
(Dec 5) Mujin Choi, Brief introduction to the Graph Minor Theorem
(Nov 14) Seokbeom Kim, Coloring Tournaments: Structures and Algorithms
(Oct 31) Hyunwoo Lee, Expander graphs
(Oct 17) Seonghyuk Im, Interactive proof system: power of randomness and beyond
(Aug 16) Mujin Choi, Sparsity
(Jun 20) Jaehyeon Seo, Extermal graphs on graph homomorphism inequalities
(May 6) Seokbeom Kim, Finite model theory
(Apr 8) Seonghyuk Im, Limit of sparse graphs
(Mar 22) Hyunwoo Lee, Quasi-randomness
(Feb 29) Mujin Choi, Tree independence numberÂ
(Feb 13) Jaehyeon Seo, Polynomial Freiman-Ruzsa theorem
(Feb 7-8) Seokbeom Kim, Induced subgraph density
(Jan 19) Hyunwoo Lee, Differential equation method
(Jan 12) Seonghyuk Im, Fixed parametrized tractability and intractability
(Dec 18) Seokbeom Kim, Polynomially chi-bounded classes and Pollyanna
(Nov 30) Hyunwoo Lee, Quadratic Fourier analysis
(Oct 30) Seonghyuk Im, Hitting time
(Aug 18) Seonghyuk Im, Coding theory
(May 20) Hyunwoo Lee, Design theory
(Mar 30) Seokbeom Kim, Tree-width and beyond
(Mar 11) Seonghyuk Im, Complexity Zoo
The Deep Seminar in Combinatorics treats various subjects in combinatorics. It is organized by graduate students in KAIST who are also in IBS DIMAG or ECOPRO. This page is managed by Jaehyeon Seo (from Yonsei University).