IBS Discrete Mathematics Group (DIMAG) is one of the research groups in the Center for Mathematical and Computational Sciences in the Institute for Basic Science, led by its Chief Investigator Sang-il Oum, a KAIST endowed chair professor in Mathematical Sciences. Established in December 2018, DIMAG is located on the 3rd floor of the Theory Building of the IBS HQ, Daejeon, South Korea with the IBS Extremal Combinatorics and Probability Group.

기초과학연구원 이산수학그룹 (IBS Discrete Mathematics Group, DIMAG)은 기초과학연구원(IBS) 수리 및 계산 과학 연구단 내에 속한 연구 그룹 중 하나로, 엄상일 CI (KAIST 지정석좌교수)가 책임을 맡고 있습니다. 2018년 12월에 설립된 이산수학그룹은 대전 IBS 본원 이론동 3층에 기초과학연구원 극단 조합 및 확률 그룹(IBS Extremal Combinatorics and Probability Group)과 함께 위치하고 있습니다.

2020-12-30 Paul Seymour, The Erdős-Hajnal conjecture is true for excluding a five-cycle
1:04:58
2020-12-30 Paul Seymour, The Erdős-Hajnal conjecture is true for excluding a five-cycle
2020-04-14 Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
54:17
2020-04-14 Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
2020-03-03 Eun-Kyung Cho, Decomposition of a planar graph into a d-degenerate graph and a graph ...
51:42
2020-03-03 Eun-Kyung Cho, Decomposition of a planar graph into a d-degenerate graph and a graph ...
2020-02-25 Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
50:14
2020-02-25 Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
2020-01-28 Dillon Mayhew, Courcelle’s Theorem for hypergraphs
54:11
2020-01-28 Dillon Mayhew, Courcelle’s Theorem for hypergraphs
2020-01-20 Adam Zsolt Wagner, The largest projective cube-free subsets of $Z_{2^n}$
50:04
2020-01-20 Adam Zsolt Wagner, The largest projective cube-free subsets of $Z_{2^n}$
2020-01-15 Ben Lund, Furstenberg sets over finite fields
57:37
2020-01-15 Ben Lund, Furstenberg sets over finite fields
2020-01-14 Sanjeeb Dash, Boolean decision rules via column generation
1:04:48
2020-01-14 Sanjeeb Dash, Boolean decision rules via column generation
2019-12-19 Attila Joó, Base partition for finitary-cofinitary matroid families
52:28
2019-12-19 Attila Joó, Base partition for finitary-cofinitary matroid families
2019-12-10 Jakub Gajarský, First-order interpretations of bounded expansion classes
1:06:21
2019-12-10 Jakub Gajarský, First-order interpretations of bounded expansion classes
2019-11-19 Ruth Luo, Induced Turán problems for hypergraphs
48:31
2019-11-19 Ruth Luo, Induced Turán problems for hypergraphs
2019-11-21 Frédéric Meunier, Topological bounds for graph representations over any field
53:51
2019-11-21 Frédéric Meunier, Topological bounds for graph representations over any field
2019-11-12 Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
46:32
2019-11-12 Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
2019-10-29 Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
1:05:28
2019-10-29 Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
2019-10-22 Joonkyung Lee (이준경), On some properties of graph norms
51:06
2019-10-22 Joonkyung Lee (이준경), On some properties of graph norms
2019-10-15 Zi Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
49:31
2019-10-15 Zi Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
2019-10-01 Casey Tompkins, Extremal problems for Berge hypergraphs
1:01:58
2019-10-01 Casey Tompkins, Extremal problems for Berge hypergraphs
2019-10-10 Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
53:14
2019-10-10 Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
2019-09-19 Cory Palmer, A survey of Turán type subgraph counting problems
50:14
2019-09-19 Cory Palmer, A survey of Turán type subgraph counting problems
2019-09-10 Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
51:57
2019-09-10 Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
2019-08-20 Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
45:49
2019-08-20 Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
2019-08-12 Hong Liu (刘鸿), Recent advance in Ramsey-Turán theory
55:09
2019-08-12 Hong Liu (刘鸿), Recent advance in Ramsey-Turán theory
2019-08-12 Péter Pál Pach, On some applications of graph theory to number theoretic problems
52:08
2019-08-12 Péter Pál Pach, On some applications of graph theory to number theoretic problems
2019-08-12 Jaehoon Kim (김재훈), Tree decompositions of graphs without large bipartite holes
56:04
2019-08-12 Jaehoon Kim (김재훈), Tree decompositions of graphs without large bipartite holes
2019-08-02 Dabeen Lee (이다빈), t-perfect graphs and the stable set problem
56:00
2019-08-02 Dabeen Lee (이다빈), t-perfect graphs and the stable set problem
2019-08-01 Euiwoong Lee (이의웅), Losing treewidth by separating subsets
54:50
2019-08-01 Euiwoong Lee (이의웅), Losing treewidth by separating subsets
2019-08-01 Sang-il Oum (엄상일), Branch depth: Generalizing tree depth of graphs
30:13
2019-08-01 Sang-il Oum (엄상일), Branch depth: Generalizing tree depth of graphs
2019-07-29 Archontia Giannopoulou, The directed flat wall theorem
44:54
2019-07-29 Archontia Giannopoulou, The directed flat wall theorem
2019-07-31 Édouard Bonnet, The FPT/W[1]-hard dichotomy of Max Independent Set in H free graphs
31:21
2019-07-31 Édouard Bonnet, The FPT/W[1]-hard dichotomy of Max Independent Set in H free graphs
2019-07-31 Magnus Wahlström, FPT algorithms via LP relaxations
1:00:22
2019-07-31 Magnus Wahlström, FPT algorithms via LP relaxations