Huy Tuan Pham, Random Cayley graphs and Additive combinatorics without groups

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

A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman's celebrated theorem first provided a structural characterization of sets with small doubling over the integers, and subsequently Ruzsa in 1999 proved an analog for abelian groups with

Tony Huynh, The Peaceable Queens Problem

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

The peaceable queens problem asks to determine the maximum number a(n) such that there is a placement of a(n) white queens and a(n) black queens on an n×n chessboard so that no queen can capture any queen of the opposite color. We consider the peaceable queens problem and its variant on the toroidal

Laure Morelle, Bounded size modifications in time 2poly(k)n2

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

A replacement action is a function L that maps each graph to a collection of subgraphs of smaller size. Given a graph class H, we consider a general family of graph modification problems, called "L-Replacement to H", where the input is a graph G and the question is whether it is

Jungho Ahn (안정호), A coarse Erdős-Pósa theorem for constrained cycles

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

An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem shows that for every positive integer k, every graph contains k vertex-disjoint cycles or a set of O(klogk) vertices which intersects every cycle of G.

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

Sepehr Hajebi, The pathwidth theorem for induced subgraphs

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

We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H, every graph of sufficiently large pathwidth contains either a large complete subgraph, a large complete bipartite induced minor, or an induced minor isomorphic to H. The

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.