Discrete mathematics is an area of mathematics studying the properties and relationship of mathematical objects having discrete structures, unlike many other areas of mathematics dealing with continuous objects. Discrete structures appear naturally in various research fields such as theoretical computer science, probability theory, dynamical systems, network theory, and topology. Because of the emergence of digital computers relying on discrete data structures, discrete mathematics has been actively investigated for the last few decades and is recognized as one of the important subjects.
DIMAG(Discrete Mathematics Group) investigates various research subjects in discrete mathematics, such as graph theory, extremal combinatorics, combinatorial optimization, matroid theory, and discrete algorithms. In addition, it aims to create an attractive and active research hub, facilitating collaborations by organizing seminars, workshops, and conferences and attracting visitors.

Website : https://dimag.ibs.re.kr

- Covering radius in the Hamming permutation space
- Improper colouring of graphs with no odd clique minor
- Mim-width III. Graph powers and generalized distance domination problems
- On the weight of Berge-F-free hypergraphs
- Online Ramsey theory for a triangle on F‐free graphs
- Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded
- Ramsey numbers of Berge-hypergraphs and related structures
- Online Ramsey theory for a triangle on F-free graphs
- Tangle-Tree Duality: In Graphs, Matroids and Beyond
- On 1-factors with prescribed lengths in tournaments