The 2nd East Asia Workshop on Extremal and Structural Graph Theory

UTOP UBLESS Hotel, Jeju, Korea (유탑유블레스호텔제주)

The 2nd East Asia Workshop on Extremal and Structural Graph Theory 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.DateOct 31, 2019 (Arrival Day) - Nov 4, 2019 (Departure Day)Venue and Date1st floor  Diamond HallUTOP UBLESS Hotel,

O-joung Kwon (권오정), Mim-width: a width parameter beyond rank-width

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

Vatshelle (2012) introduced a width parameter called mim-width. It is based on the following cut function : for a vertex partition (A,B) of a graph, the complexity of this partition is computed by the size of a maximum induced matching of the bipartite subgraph induced by edges between A and B. This parameter naturally extends

O-joung Kwon (권오정), Directed tangles and applications

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

The canonical tree-decomposition theorem, proved by Robertson and Seymour in their seminal graph minors series, turns out to be an extremely valuable tool in structural and algorithmic graph theory. In this paper, we prove the analogous result for digraphs, the directed tangle tree-decomposition theorem. More precisely, we introduce directed tangles and provide a directed tree-decomposition

O-joung Kwon (권오정), Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)

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

In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying u and v, each edge incident to exactly one of u and v is coloured red. Bonnet, Kim, Thomassé, and Watrigant defined the twin-width of a graph G to be the minimum integer

O-joung Kwon (권오정), Erdős-Pósa property of A-paths in unoriented group-labelled graphs

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

A family F of graphs is said to satisfy the Erdős-Pósa property if there exists a function f such that for every positive integer k, every graph G contains either k (vertex-)disjoint subgraphs in F or a set of at most f(k) vertices intersecting every subgraph of G in F. We characterize the obstructions to

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.