IBS Discrete Mathematics Group (이산수학그룹)

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. Established on December 2018, DIMAG aims to carry out top-class research in the field of discrete mathematics and combinatorics. DIMAG is located in the 2nd floor of the Theory Building of the IBS HQ, Daejeon, South Korea.

기초과학연구원 이산수학그룹 (IBS Discrete Mathematics Group, DIMAG)은 기초과학연구원(IBS) 수리 및 계산 과학 연구단 내에 속한 연구 그룹 중 하나로, 엄상일 CI가 책임을 맡고 있습니다. 2018년 12월에 설립된 DIMAG은 이산수학 분야 최고 수준의 연구를 하는 것을 목표로 하고 있습니다. DIMAG은 대전 IBS 본원 이론동 2층에 위치하고 있습니다.

Upcoming events

Discrete Math Seminar

Workshops and Conferences

  • Seymour is Seventy

    Monday, June 15, 2020Friday, June 19, 2020 at ENS de Lyon, Lyon, France

Research Program

There are no upcoming events at this time.

News

Dabeen Lee received the INFORMS Optimization Society Student Paper Prize on October 20, 2019

On October 20, 2019, Dabeen Lee (이다빈), a research fellow at the IBS discrete mathematics group, received the 2nd place prize in the INFORMS Optimization Society Student Paper Prize. This prize was established in 2006 by the Optimization Society of the Institute for Operations Research and the Management Sciences and is awarded annually at the …

DIMAG hosted “The 2nd East Asia Workshop on Extremal and Structural Graph Theory” at Jeju

From October 31 to November 4, 2019, IBS discrete mathematics group hosted the 2nd East Asia Workshop on Extremal and Structural Graph Theory in Jeju. It is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the East Asia such as China, Japan, and Korea. Participants have …

Pascal Gollin gave a talk on the existence of a decomposition of an infinite graph into spanning trees at the discrete math seminar

On October 29, 2019, Pascal Gollin from IBS discrete mathematics group gave a talk on the existence of a decomposition of an infinite graph into spanning trees in terms of the existence of packing and covering of spanning trees at the discrete math seminar. The title of his talk was “A Cantor-Bernstein-type theorem for spanning …

Visitors

  • Tue
    05
    Nov
    2019
    Fri
    15
    Nov
    2019
    Monash University
  • Tue
    12
    Nov
    2019
    Fri
    22
    Nov
    2019
    University of California, San Diego
  • Wed
    13
    Nov
    2019
    Hanoi University of Science and Technology
  • Fri
    06
    Dec
    2019
    Sat
    14
    Dec
    2019
  • Mon
    13
    Jan
    2020
    Fri
    17
    Jan
    2020
    IBM Thomas J. Watson Research Center

Videos