On October 28, 2026, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the proof of the Erdős-Szemerédi sunflower conjecture. The title of his talk was “Proof of the Erdős-Szemerédi sunflower conjecture“.
Hyunwoo Lee (이현우), Proof of the Erdős-Szemerédi sunflower conjecture
In the 1970s, Erdős and Szemerédi conjectured that for any $n \ge k-1\ge 2$, any collection of subsets of $[n]$ not containing a $k$-sunflower has size at most $c_k^n$ for some $c_k<2$. In the $k=3$ case, this follows from the work of Croot, Lev, and Pach and Ellenberg and Gijswijt on the cap-set problem, through a reduction due to Alon, Shpilka, and Umans. We prove the conjecture for every $k \ge 3$.
This is joint work with Matija Bucić and Fankang He.
Hyunwoo Lee (이현우) gave a talk on a recent new lower bound for the multicolor triangle Ramsey number by OpenAI at the Discrete Math Seminar
On August 7, 2026, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on a recent super-exponential lower bound for the multicolor triangle Ramsey number by OpenAI. The title of his talk was “A super-exponential lower bound construction for the multicolor triangle Ramsey problem discovered by OpenAI“.
Hyunwoo Lee (이현우), A super-exponential lower bound construction for the multicolor triangle Ramsey problem discovered by OpenAI
Let $R_k(3)$ denote the smallest integer $N$ such that every $k$-edge-coloring of the complete graph $K_N$ contains a monochromatic triangle. A simple inductive argument gives the classical factorial upper bound $R_k(3)\leq k!=k^{O(k)}$, whereas the best previously known lower bound was only exponential in $k$, namely, $R_k(3)\geq 2^{\Omega(k)}$. It was a longstanding open problem of Erd\H{o}s whether $R_k(3)$ grows exponentially or super-exponentially in $k$.
On August 1, 2026, OpenAI, using an internal AI model, discovered a construction establishing the super-exponential lower bound $R_k(3)\geq k^{\Omega(k)}$, thereby resolving Erdős’ longstanding question. In this talk, I will explain the construction and discuss possible directions for further research, some of which may already have been explored by other researchers.
Hyunwoo Lee (이현우) gave a talk on determining the matching polynomial of k-uniform hypergraphs from the list of all induced subhypergraphs of fixed size at the Discrete Math Seminar
On April 1, 2025, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the problem of determinining the matching polynomial of k-uniform hypergraphs from the list of all induced subhypergraphs of fixed size. The title of his talk was “Reconstructing hypergraph matching polynomials“.
Hyunwoo Lee (이현우), Reconstructing hypergraph matching polynomials
By utilizing the recently developed hypergraph analogue of Godsil’s identity by the second author, we prove that for all $n \geq k \geq 2$, one can reconstruct the matching polynomial of an $n$-vertex $k$-uniform hypergraph from the multiset of all induced sub-hypergraphs on $\lfloor \frac{k-1}{k}n \rfloor + 1$ vertices. This generalizes the well-known result of Godsil on graphs in 1981 to every uniform hypergraph. As a corollary, we show that for every graph $F$, one can reconstruct the number of $F$-factors in a graph under analogous conditions. We also constructed examples that imply the number $\lfloor \frac{k-1}{k}n \rfloor + 1$ is the best possible for all $n\geq k \geq 2$ with $n$ divisible by $k$. This is joint work Donggyu Kim.
2024 Korean Student Combinatorics Workshop was held in Gongju from July 29 to August 2, 2024
The 2024 Korean Student Combinatorics Workshop (KSCW2024, 2024 조합론 학생 워크샵) was held in Gongju from July 29 to August 2, 2024. Sponsored by the IBS Discrete Mathematics Group, this event aims to provide a platform for Korean graduate students working on combinatorics and related areas to establish a foundation for collaborative research. It was organized by four students of KAIST/IBS: Donggyu Kim (김동규), Seokbeom Kim (김석범), Seonghyuk Im (임성혁), and Hyunwoo Lee (이현우). The workshop featured two invited talks by Semin Yoo (유세민) and Jungho Ahn (안정호), as well as open problem sessions followed by ample time for joint work.
Hyunwoo Lee (이현우) gave a talk on disproving Kahn’s conjecture on matchings in d-regular linear hypergraphs at the Discrete Math Seminar
On July 5, 2024, Hyunwoo Lee (이현우) from KAIST and the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on disproving Kahn’s conjecture (1995) on matchings in d-regular linear hypergraphs. The title of his talk was “Random matchings in linear hypergraphs“.
Hyunwoo Lee (이현우), Random matchings in linear hypergraphs
For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the probability that $M$ does not cover $v$ is $(1 + o_d(1))d^{-1/k}$ for all vertices $v\in V(H)$. This conjecture was proved for $k = 2$ by Kahn and Kim in 1998. In this paper, we disprove this conjecture for all $k \geq 3.$ For infinitely many values of $d,$ we construct $d$-regular linear $k$-uniform hypergraph $H$ containing two vertices $v_1$ and $v_2$ such that $\mathcal{P}(v_1 \notin M) = 1 – \frac{(1 + o_d(1))}{d^{k-2}}$ and $\mathcal{P}(v_2 \notin M) = \frac{(1 + o_d(1))}{d+1}.$ The gap between $\mathcal{P}(v_1 \notin M)$ and $\mathcal{P}(v_2 \notin M)$ in this $H$ is best possible. In the course of proving this, we also prove a hypergraph analog of Godsil’s result on matching polynomials and paths in graphs, which is of independent interest.
Hyunwoo Lee (이현우) gave a talk on the existence of a Steiner triple system in a 3-uniform hypergraph with large minimum codegree at the Discrete Math Seminar
On November 28, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the existence of a Steiner triple system in a 3-uniform hypergraph with large minimum codegree. The title of his talk was “Towards a high-dimensional Dirac’s theorem“.







