• Combinatorial and Discrete Optimization (2019 KSIAM Annual Meeting)

    Venezia Hotel & Resort Yeosu, Yeosu, Korea (여수 베네치아 호텔) 

    Special Session @ 2019 KSIAM Annual MeetingA special session on "Combinatorial and Discrete Optimization" at the 2019 KSIAM Annual Meeting is organized by Dabeen Lee. URL: https://www.ksiam.org/conference/84840fb6-87b0-4566-acc1-4802bde58fbd/welcomeDateNov 8, 2019 – Nov 9, 2019 Address: 61-13 Odongdo-ro, Sujeong-dong, Yeosu-si, Jeollanam-do (전남 여수시 오동도로 61-13)VenueVenezia Hotel & Resort Yeosu, Yeosu, Korea (여수 베네치아 호텔)  Address: 61-13 Odongdo-ro, Sujeong-dong,

  • Sang-il Oum (엄상일), Survey on vertex-minors

    Room B232 IBS (기초과학연구원)

    For a vertex v of a graph G, the local complementation at v is an operation to obtain a new graph denoted by G*v from G such that two distinct vertices x, y are adjacent in G*v if and only if both x, y are neighbors of v and x, y are non-adjacent, or at least one

  • Sang-il Oum (엄상일), What is an isotropic system?

    Room B232 IBS (기초과학연구원)

    Bouchet introduced isotropic systems in 1983 unifying some combinatorial features of binary matroids and 4-regular graphs. The concept of isotropic system is a useful tool to study vertex-minors of graphs and yet it is not well  known. I will give an introduction to isotropic systems.

  • Sang-il Oum (엄상일), Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

    Room B232 IBS (기초과학연구원)

    Every minor-closed class of matroids of bounded branch-width can be characterized by a minimal list of excluded minors, but unlike graphs, this list could be infinite in general. However, for each fixed finite field $\mathbb F$, the list contains only finitely many $\mathbb F$-representable matroids, due to the well-quasi-ordering of $\mathbb F$-representable matroids of bounded