IBS Discrete Mathematics Group 기초과학연구원 이산수학그룹

22/07/2026

*O-joung Kwon* and Xiaopan Lian,
Group vertex-arboricity of group-labelled graphs,
Discrete Math., accepted, 2026.

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $Γ$, a $Γ$-labelled graph is a graph whose edges are labelled by elements of $Γ$. For an abelian group $Γ$ and $A\subseteq Γ$, the $(Γ, A)$-vertex-arboricity of a $Γ$-labelled graph is the minimum integer $k$ su...

21/07/2026

Zichao D**g gave a talk on the maximum size of a set family in which, for each i≤k, every intersection of i members has a prescribed parity at the Discrete Math Seminar

On July 21, 2026, Zichao D**g from the IBS Extremal Combinatorics and Probability Group gave a talk on the maximum size of a set family in which, for each i ≤ k, every intersection of i members has a prescribed parity at the Discrete Math Seminar. The title of his talk was "k-wise odd-even towns". https://www.youtube.com/watch?v=0T5pmKTH8Vs

https://dimag.ibs.re.kr/2026/k-wise-odd-even-town/

On July 21, 2026, Zichao D**g from the IBS Extremal Combinatorics and Probability Group a talk on the maximum size of a set family in which, for each i ≤ … Continue reading "Zichao D**g gave a talk on the maximum size of a set family in which, for each i≤k, every intersection of i members has ...

21/07/2026

*Sang-il Oum*,
A proof of the cycle double cover conjecture by OpenAI: An exposition, 2026.

The cycle double cover conjecture states that every bridgeless graph has a list of cycles such that every edge is in exactly two of them. In July 2026, OpenAI announced a proof. This exposition presents the proof with slight modifications intended to make it more accessible.

21/07/2026

Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, *Roohani Sharma*, and Meirav Zehavi,
Maximum Partial List H-Coloring on $P_5$-free graphs in polynomial time,
J. Graph Theory, accepted, 2026.

In this article we show that Maximum Partial List H-Coloring is polynomial-time solvable on P_5-free graphs for every fixed graph H. In particular, this implies that Maximum k-Colorable Subgraph is polynomial-time solvable on P_5-free graphs. This answers an open question from Agrawal, Lima, Lokshta...

16/07/2026

Sang-il Oum (엄상일) gave a talk at the Discrete Math Seminar on a recent proof of the cycle double cover conjecture by OpenAI

On July 16, 2026, Sang-il Oum from the IBS Discrete Mathematics Group gave a talk on a recent proof the cycle double cover conjecture by OpenAI at the Discrete Math Seminar. The title of his talk was "A proof of the cycle double cover conjecture by OpenAI". https://www.youtube.com/watch?v=TH7huW27BHA

https://dimag.ibs.re.kr/2026/cdc/

On July 16, 2026, Sang-il Oum from the IBS Discrete Mathematics Group gave a talk on a recent proof the cycle double cover conjecture by OpenAI at the Discrete Math … Continue reading "Sang-il Oum (엄상일) gave a talk at the Discrete Math Seminar on a recent proof of the cycle double cover conj...

14/07/2026

Yaobin Chen gave a talk on the maximum size of a subset in general position of a random subset of a finite-dimensional vector space over a finite field

On July 14, 2026, Yaobin Chen from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the maximum size of a subset in general position of a random subset of a finite-dimensional vector space over a finite field. The title of his talk was "Maximum in-general-position set in a random subset of $\mathbb{F}_q^d$". https://www.youtube.com/watch?v=SCls0AFRwjo

https://dimag.ibs.re.kr/2026/yaobin-chen-seminar/

On July 14, 2026, Yaobin Chen from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the maximum size of a subset in … Continue reading "Yaobin Chen gave a talk on the maximum size of a subset in general position of a random subset of a finite-dimensi...

13/07/2026

Dario Cavallaro, *Maximilian Gorsky*, Stephan Kreutzer, Dimitrios M. Thilikos, and Sebastian Wiederrecht,
Optimal Bounds for the k-Disjoint Paths Problem,
In the Proceedings of the 67th Annual Symposium on Foundations of Computer Science (FOCS 2026, New York City, NY, USA, November 8-11, 2026), accepted, 2026.

13/07/2026

2026 Workshop on Topological Combinatorics Successfully Held at GIST

The 2026 Workshop on Topological Combinatorics was successfully held at Gwangju Institute of Science and Technology (GIST) from June 28 to July 11, 2026....

The 2026 Workshop on Topological Combinatorics was successfully held at Gwangju Institute of Science and Technology (GIST) from June 28 to July 11, 2026. The workshop was organized by Andreas Holmsen (KAIST & IBS DIMAG), Jinha Kim … Continue reading "2026 Workshop on Topological Combinatorics Succ...

11/07/2026

Welcome Yaobin Chen and Simón Piga, new members of IBS ECOPRO

The IBS Discrete Mathematics Group welcomes Dr. Yaobin Chen and Dr. Simón Piga, new research fellows at the IBS Extremal Combinatorics and Probability Group, starting July 1, 2026....

The IBS Discrete Mathematics Group welcomes Dr. Yaobin Chen and Dr. Simón Piga, new research fellows at the IBS Extremal Combinatorics and Probability Group, starting July 1, 2026. Yaobin Chen … Continue reading "Welcome Yaobin Chen and Simón Piga, new members of IBS ECOPRO"

11/07/2026

Ting-Wei Chao gave a talk on a variation of the odd town problem at the Discrete Math Seminar

On July 10, 2026, Ting-Wei Chao from MIT gave a talk at the Discrete Math Seminar on a variation of the odd town problem. The title of his talk was "The Oddtown Problem Modulo a Composite Number". https://www.youtube.com/watch?v=N576QJkJUyE

https://dimag.ibs.re.kr/2026/ting-wei-chao-seminar-2/

On July 10, 2026, Ting-Wei Chao from MIT gave a talk at the Discrete Math Seminar on a variation of the odd town problem. The title of his talk was … Continue reading "Ting-Wei Chao gave a talk on a variation of the odd town problem at the Discrete Math Seminar"