IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag) header
IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag) profile picture

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

@ibsdimag

Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, Korea

 대한민국 유성구
dimag.ibs.re.kr/
Joined October 2018
  • Tweets1.1K
  • Following1
  • Followers255
457Media
Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)Photo by IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
On Oct 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. "Proof of the Erdős-Szemerédi sunflower conjecture". dimag.ibs.re.kr/2026/sunflow…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
1
2
208
#New_arXiv_paper *Ilkyoo Choi* and Hojin Chu, On strong odd colorings of sparse graphs, 2026. arxiv.org/abs/2610.34874
On strong odd colorings of sparse graphs

On strong odd colorings of sparse graphs

A strong odd coloring of a graph is a proper vertex coloring such that for every vertex $v$, each color appearing on the neighborhood of $v$ appears an odd number of times. We investigate strong...

arxiv.org
1
1
256
#New_arXiv_paper Stephen Chung and *William J. Wesley*, Constructions for Nearly Diagonal Book Ramsey Numbers, 2026 arxiv.org/abs/2610.36522
Constructions for Nearly Diagonal Book Ramsey Numbers

Constructions for Nearly Diagonal Book Ramsey Numbers

The Ramsey number $R(G_1,G_2)$ is the smallest positive integer $n$ such that for every graph $H$ on $n$ vertices, either $H$ contains a copy of $G_1$ or the complement $\overline H$ contains a...

arxiv.org
38
On Oct 27, 2026, Xiying Du from @ibsdimag gave a talk at Discrete Math Seminar on characterizing graphs admitting two disjoint connected subgraphs containing X and Y, resp., for any pair (X,Y) of sets of size 2 and 3. "Characterizing (2,3)-linked graphs" dimag.ibs.re.kr/2026/xiying-…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
2
1
247
The 2026 Combinatorics Workshop (2026 조합론 학술대회) was held from October 20, 2026 to October 22, 2026 at Gonjiam Resort, Gwangju. There were 1 plenary talk, 5 invited talks, and 14 contributed talks. dimag.ibs.re.kr/2026/2026-co…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
3
293
#new_arXiv_paper *Seokbeom Kim* and *Sang-il Oum*, Every tournament of dichromatic number 10k^2 has a vertex whose out-neighborhood has dichromatic number more than k, 2026. arxiv.org/abs/2610.29043
Every tournament of dichromatic number $10 k^2$ has a vertex whose...

Every tournament of dichromatic number $10 k^2$ has a vertex whose...

The dichromatic number of a tournament is the minimum number of colors needed to color the vertices so that no directed cycle is monochromatic. Nguyen, Scott, and Seymour (2025) asked whether...

arxiv.org
1
3
255
#New_arXiv_paper Jungho Ahn, Lars Jaffke, *O-joung Kwon*, Paloma T. de Lima, Hyemi Park, An Erdős-Pósa theorem for induced packings of even cycles, 2026 arxiv.org/abs/2610.22967
An Erdős-Pósa theorem for induced packings of even cycles

An Erdős-Pósa theorem for induced packings of even cycles

We show that for every graph $G$ and every positive integer $k$, $G$ contains either $k$ vertex-disjoint even cycles with no edges between distinct cycles, or a set of $O(k^2\log k)$ vertices...

arxiv.org
2
1
480
#New_arXiv_paper Jan Dreier, Robert Ganian, Marlene Gründel, *Roohani Sharma*, and Simon Wietheger, Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity, 2026. arXiv.org/abs/2610.18540
Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity

Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity

The Boolean Satisfiability (SAT) problem is a remarkably expressive computational problem, serving both as a cornerstone of complexity theory and as a unifying language for a wide range of search...

arxiv.org
2
206
#New_arXiv_paper Jongseo Lee, *Roohani Sharma*, and Sebastian Wiederrecht, Hitting Minors: Stronger Lower Bounds, 2026. arxiv.org/abs/2610.17664
Hitting Minors: Stronger Lower Bounds

Hitting Minors: Stronger Lower Bounds

For a fixed finite collection of graphs $\mathcal{F}$, the $\mathcal{F}$-Minor-Free Deletion problem asks, given a graph $G$ and an integer $k$, whether there is a set $S\subseteq V(G)$ with...

arxiv.org
2
2
246
#New_arXiv_paper Esther Galby, *Roohani Sharma*, and Bart van der Steenhoven, Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances, 2026. arxiv.org/abs/2610.16869
Tractability of Hard Digraph Cut Problems on Eulerian Instances:...

Tractability of Hard Digraph Cut Problems on Eulerian Instances:...

Eulerian digraphs retain the directional structure of general digraphs while exhibiting a symmetry of cuts reminiscent of undirected graphs. We show that this symmetry extends beyond individual...

arxiv.org
1
176
On October 13, 2026, Julien Codsi from Princeton University gave a talk on various results on the tree-independence number of graphs. The title of his talk was “Recent progress in the tree-⍺ world“. dimag.ibs.re.kr/2026/julien-…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
2
1
209
#New_published_paper *Meike Hatzel*, Chun-Hung Liu, Bruce Reed, and Sebastian Wiederrecht, Bounds on treewidth via excluding disjoint unions of cycles, Electron. J. Combin., 33(4), #P4.8, October 2026. doi.org/10.37236/13735
1
1
265
On Oct 6, 2026, Daniel McGinnis from @ibsdimag gave a talk at the Discrete Math Seminar on a commutative-algebraic approach to regularity that yields an optimal colorful fractional Helly theorem for d-Leray simplicial complexes. dimag.ibs.re.kr/2026/daniel-…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
1
150
#New_arXiv_paper *William J. Wesley*, An elementary proof of the 2-regularity of Pythagorean triples, 2026 arxiv.org/abs/2609.39063
An elementary proof of the 2-regularity of Pythagorean triples

An elementary proof of the 2-regularity of Pythagorean triples

We give a new proof of the fact that every 2-coloring of the positive integers contains a monochromatic Pythagorean triple. This result was originally proven by Heule, Kullmann, and Marek with SAT...

arxiv.org
1
1
213
#New_arXiv_paper *Sang-il Oum* and David R. Wood, A double-logarithmic upper bound on the chromatic number of the associahedron, 2026. arxiv.org/abs/2609.39015
A double-logarithmic upper bound on the chromatic number of the...

A double-logarithmic upper bound on the chromatic number of the...

We show that the associahedron $\mathcal{A}_n$ has chromatic number $O(\log\log n)$, improving on the previously best known upper bound of $O(\log n)$.

arxiv.org
1
1
194
#New_accepted_paper Jorge Olivares-Vinales and *Semin Yoo*, Towers and Bratteli-Vershik systems in Fibonacci-like unimodal maps, Int. Math. Res. Not. IMRN, accepted, 2026. arxiv.org/abs/2602.21623
Towers and Bratteli-Vershik systems in Fibonacci-like unimodal maps

Towers and Bratteli-Vershik systems in Fibonacci-like unimodal maps

For a class of Fibonacci-like unimodal maps, the restriction to the $ω$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically...

arxiv.org
1
207
#New_accepted_conference_paper Jan Drier, Robert Ganian, Marlene Gründel, *Roohani Sharma*, and Simon Wietheger, Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity, In the Proceedings of SODA 2027 (January 24-27, 2027, Philadelphia, USA), accepted, 2026.
2
2
451
#New_arXiv_paper *William J. Wesley*, The Fibonacci numbers are not 3-accessible, 2026. arxiv.org/abs/2609.33744
The Fibonacci numbers are not 3-accessible

The Fibonacci numbers are not 3-accessible

A $D$-diffsequence is a sequence of integers $x_1 < \dots < x_k$ such that $x_{i+1} -x_i \in D$ for $1 \le i \le k-1$. The set $D$ is called $r$-accessible if every $r$-coloring of the positive...

arxiv.org
1
187
#New_accepted_conference_paper *Mujin Choi*, Tuukka Korhonen, and *Sang-il Oum*, Branch-width of represented matroids in matrix multiplication time, In the Proceedings of SODA 2027 (Philadelphia, USA, January 24-27, 2027), accepted, 2026. arxiv.org/abs/2605.14428
Branch-width of represented matroids in matrix multiplication time

Branch-width of represented matroids in matrix multiplication time

For an $n$-element matroid $M$ given by an $n \times n$ matrix representation over a finite field $\mathbb F$ and an integer $k$, we present an algorithm with running time $O_{k,\mathbb...

arxiv.org
1
2
366
On September 22, 2026, David R. Wood from Monash University gave a talk on coloring graphs without K_t minor with t colors while avoiding large monochromatic components at the Discrete Math Seminar. "Proof of the Clustered Hadwiger Conjecture". dimag.ibs.re.kr/2026/cluster…
Image from IBS Discrete Mathematics Group (기초과학연구원 이산수학그룹) (@ibsdimag)
1
1
246
Load more