기초과학연구원 이산수학그룹
On July 8, 2025, Mihyun Kang (강미현) from the TU Graz gave a talk at the Discrete Math Seminar on the random subgraph of a hypercube and the Cartesian product of regular graphs. The title of her talk was “Phase transitions in a random subgraph of the hypercube“.
On July 1, 2025, Sergey Norin from McGill University gave a talk at the Discrete Math Seminar on the asymptotic dimension of intersection graphs. The title of his talk was “Asymptotic dimension of intersection graphs“.
On June 25, 2025, Roohani Sharma from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the polynomial kernel for the problem of deleting vertices to make a graph $K_{2,p}$-minor-free. The title of her talk was “Uniform and Constructive Polynomial Kernel for Deletion to $K_{2,p}$-Minor-Free Graphs“.
On June 17, 2025, Attila Jung from the Eötvös Loránd University, Hungary gave a talk at the Discrete Math Seminar on combining the fractional Helly theorem and the quantitative volume theorem on convex sets optimally. The title of his talk was “The Quantitative Fractional Helly Theorem“.
On June 10, 2025, On-Hei Solomon Lo from Tongji University in Shanghai gave a talk at the Discrete Math Seminar on characterizing minor-minimal 3-connected non-Hamiltonian graphs. The title of his talk was “Minors of non-hamiltonian graphs“.
On June 4, 2025, Denys Bulavka from the Hebrew University of Jerusalem gave a talk at the Discrete Math Seminar on the maximum size of intersecting families of k-element facets in simplicial complexes. The title of his talk was “Strict Erdős-Ko-Rado Theorems for Simplicial Complexes“.
On May 27, 2025, Meike Hatzel from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the existence of a graph of arbitrary large girth and chromatic number admitting a proper edge coloring without a color appearing alone in any cycle. The title of her talk was “Counterexample to Babai’s lonely colour conjecture“.
On May 13, 2025, Seokbeom Kim (김석범) from KAIST and the IBS Discrete Mathematics Group gave a talk on the structure of tournaments without a fixed 5-vertex tournament and its applications to the dichromatic number at the Discrete Math Seminar. The title of his talk was “The structure of △(1, 2, 2)-free tournaments“.
On April 29, 2025, Eunjin Oh (오은진) from POSTECH gave a talk at the Discrete Math Seminar on an almost linear-time approximation algorithm for the minimum-weight b-edge cover on geometric complete bipartite graphs. The title of her talk was “Approximation Algorithms for the Geometric Multimatching Problem“.
On April 28, 2025, Pascal Schweitzer from the Technical University of Darmstadt gave a talk on finding symmetries and deciding isomorphic graphs at the Discrete Math Seminar. The title of his talk was “Recent insights surrounding combinatorial approaches to isomorphism and symmetry problems“.