On February 18, 2025, O-joung Kwon (권오정) from Hanyang University gave a talk on the condition for the existence of disjoint A-paths in group-labelled graphs at the Discrete Math Seminar. The title of his talk was “Erdős-Pósa property of A-paths in unoriented group-labelled graphs“.
Maximilian Gorsky gave lectures at the second week of the IBS-DIMAG Winter School on Graph Minors
From February 10 to 12, 2025, the second week of the IBS-DIMAG Winter School on Graph Minors took place at IBS. This week, Maximilian Gorsky from the IBS Discrete Mathematics Group gave lectures on classifying society using a structure called transaction meshes.

Jungho Ahn (안정호) gave a talk on the Erdős-Pósa property for the induced packing of cycles at the Discrete Math Seminar
On February 11, 2025, Jungho Ahn (안정호) from KIAS gave a talk on the Erdős-Pósa property for the induced packing of cycles at the Discrete Math Seminar. The title of his talk was “A coarse Erdős-Pósa theorem for constrained cycles“.
Sebastian Wiederrecht and Maximilan Gorsky are delivering lectures at the three-week-long IBS-DIMAG Winter School on Graph Minors, which has just concluded its first week of sessions
The IBS-DIMAG Winter School on Graph Minors is taking place at IBS every Monday, Tuesday, and Wednesday over a three-week period, beginning on February 3, 2025. Sebastian Wiederrecht (KAIST) and Maximilian Gorsky (IBS Discrete Mathematics Group) are giving lectures. In the first week, the topics covered included the two-paths theorem, the flat wall theorem, and various results on societies, transactions, and vortices.

Jang Soo Kim gave a talk on the maximum of the minimum number of generators to represent an element in a monoid of functions on a fixed finite set and its connection to the minimum feedback arc set of a tournament at the Discrete Math Seminar
On February 4, 2025, Jang Soo Kim (김장수) from Sungkyunkwan University gave a talk on the maximum of the minimum number of generators to represent an element in a monoid of functions on a fixed finite set and its connection to the minimum feedback arc set of a tournament at the Discrete Math Seminar. The title of his talk was “Longest elements in a semigroup of functions and Slater indices“.
Laure Morelle gave a talk on the parametrized complexity of modifying a graph into a minor-closed class of graphs at the Discrete Math Seminar
On January 21, 2025, Laure Morelle from the LIRMM gave a talk at the Discrete Math Seminar on the parameterized complexity of modifying a graph into a minor-closed class of graphs. The title of her talk was “Bounded size modifications in time $2^{poly(k)} n^2$“.
Tony Huynh gave a talk on the peaceable queens problem on the toroidal board at the Discrete Math Seminar
On January 14, 2025, Tony Huynh from the Sapienza Università di Roma gave a talk on the peaceable queens problem on the toroidal board at the Discrete Math Seminar. The title of his talk was “The Peaceable Queens Problem“.
Huy Tuan Pham gave a talk on combinatorial methods for problems on additive combinatorics and random Cayley graphs at the Discrete Math Seminar
On January 3, 2025, Huy Tuan Pham from the Institute for Advanced Study and the Clay Mathematics Institute gave a talk at the Discrete Math Seminar on combinatorial methods for problems on additive combinatorics and random Cayley graphs. The title of his talk was “Random Cayley graphs and Additive combinatorics without groups“.
Zixiang Xu gave a talk on using linear algebra to prove stability results in extremal set theory at the Discrete Math Seminar
On December 23, 2024, Zixiang Xu (徐子翔) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on using linear algebra to prove stability results in extremal set theory. The title of his talk was “Multilinear polynomial methods and stability results on set systems“.
Joonkyung Lee (이준경) gave a talk at the Discrete Math Seminar on using Lorentzian polynomials to prove a non-trivial upper bound on the number of graph homomorphisms
On December 17, 2024, Joonkyung Lee (이준경) from Yonsei University gave a talk on using Lorentzian polynomials to prove a non-trivial upper bound on the number of graph homomorphisms at the Discrete Math Seminar. The title of his talk was “Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials“.











