Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
Room B232 IBS (기초과학연구원)A (vertex)
10 events found.
Eun-Kyung Cho (조은경), Decomposition of a planar graph into a
Room B232
IBS (기초과학연구원)
Given a graph
Dabeen Lee (이다빈), On a generalization of the Chvátal-Gomory closure
Room B232 IBS (기초과학연구원)Integer programming is the problem of optimizing a linear function over the set of integer solutions satisfying a system of inequalities. The most successful technique in practice is the so-called "cutting-plane" algorithm in combination with branch-and-bound enumeration. Cutting-planes for an integer linear program are linear inequalities that are valid for all integer feasible solutions but …
Kevin Hendrey, Covering radius in the Hamming permutation space
Room B232 IBS (기초과학연구원)Our problem can be described in terms of a two player game, played with the set
Ringi Kim (김린기), The strong clique number of graphs with forbidden cycles
Room B232 IBS (기초과학연구원)The strong clique number of a graph
Pascal Gollin, Disjoint dijoins for classes of dibonds in finite and infinite digraphs
Room B232 IBS (기초과학연구원)A dibond in a directed graph is a bond (i.e. a minimal non-empty cut) for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals the maximum …
Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
Room B232 IBS (기초과학연구원)In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a
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 …
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Room B232 IBS (기초과학연구원)Given a graph
Canceled
KSIAM 2020 Spring Conference (cancelled)
IBS Science Culture CenterKSIAM 2020 Spring Conference will be held at IBS from May 8, 2020 to May 9, 2020. Organized by Korean Society for Industrial and Applied Mathematics. Organizing Committee Myungjoo Kang (Seoul National University) (chair) Ahn, Jaemyung (KAIST) Kwon, Hee-Dae (Inha University) Lee, Eun Jung (Yonsei University) Jang, Bongsoo (UNIST) Jung, Miyoun (Hankuk University of Foreign …