Akash Kumar, Random walks and Forbidden Minors

Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]

Random walks and spectral methods have had a strong influence on modern graph algorithms as evidenced by the extensive literature on the subject. In this talk, I will present how

Raul Lopes, Temporal Menger and related problems

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

A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability,

Brett Leroux, Expansion of random 0/1 polytopes

Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]

A conjecture of Milena Mihail and Umesh Vazirani states that the edge expansion of the graph of every 0/1 polytope is at least one. Any lower bound on the edge expansion gives

Sebastian Wiederrecht, Killing a vortex

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

The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every tN, there exists some constant ct such that every Kt-minor-free graph admits a tree

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.