The IBS Discrete Mathematics Group welcomes Ho Kim (김호), a new graduate student of the Discrete Mathematics Group from May 1, 2025. He received his B.S. degree from Hanyang University and entered the Department of Mathematical Sciences at KAIST as a graduate student on September 2024. His advisor is Jaehoon Kim (김재훈).
Eunjin Oh (오은진) gave a talk on an almost linear-time approximation algorithm for the minimum-weight b-edge cover on geometric complete bipartite graphs at the Discrete Math Seminar
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“.
Pascal Schweitzer gave a talk on finding symmetries and deciding isomorphic graphs at the Discrete Math Seminar
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“.
Marcin Briański gave a talk at the Discrete Math Seminar on the existence of large Burling graphs or large complete graphs on string graphs of very large chromatic number
On April 22, 2025, Marcin Briański from Jagiellonian University in Krakóv, Poland gave a talk on the existence of large Burling graphs or large complete graphs on string graphs of very large chromatic number at the Discrete Math Seminar. The title of his talk was “Burling Graphs as (almost) universal obstacles to 𝜒-boundedness“.
Nicola Lorenz gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar
On April 15, 2025, Nicola Lorenz from the University of Hamburg gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar. The title of her talk was “A Minor Characterisation of Normally Spanned Sets of Vertices“.
Daniel McGinnis gave a talk at the Discrete Math Seminar on determining the existence of a k-dimensional affine subspace intersecting every member of a given finite family of convex sets in the d-dimensional real space
On April 14, 2025, Daniel McGinnis from Princeton University gave a talk on determining the existence of a k-dimensional affine subspace intersecting every member of a given finite family of convex sets in the d-dimensional real space at the Discrete Math Seminar. The title of his talk was “A necessary and sufficient condition for k-transversals“.
Marcelo Garlet Milani gave a talk on the directed grid theorem at the Discrete Math Seminar
On April 8, 2025, Marcelo Garlet Milani from NII, Japan gave a talk at the Discrete Math Seminar on an alternative proof of the directed grid theorem. The title of his talk was “Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem“.
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“.
Michał T. Seweryn gave a talk on the existence of Kelly’s poset in a poset of sufficient large dimension with a planar cover graph at the Discrete Math Seminar
On March 18, 2025, Michał T. Seweryn from Charles University gave a talk at the Discrete Math Seminar showing that every poset of very large dimension with a planar cover graph has Kelly’s poset of large dimension. The title of his talk was “Dimension and standard examples in planar posets“.
Johannes Carmesin gave a talk at the Discrete Math Seminar on open problems related to temporal graphs and connectivity augmentations
On March 11, 2025, Johannes Carmesin from TU Freiberg gave a talk on open problems related to temporal graphs and connectivity augmentations at the Discrete Math Seminar. The title of his talk was “Open problems in graph theory“.