Carl R. Yerger, Solving Problems in Graph Pebbling using Optimization and Structural Techniques

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

Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebbling on an adjacent vertex. The pebbling number of a graph is the smallest number of pebbles necessary such that, given any initial configuration

Domagoj Bradač, Effective bounds for induced size-Ramsey numbers of cycles

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

The k-color induced size-Ramsey number of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there exists a monochromatic copy of H which is an induced subgraph of G. In 1995, in their seminal paper, Haxell, Kohayakawa and Łuczak showed that

Matija Bucić, TBA

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

Bruce A. Reed, TBA

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

Shira Zerbib, TBA

Room B332 IBS (기초과학연구원)
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.