Lars Jaffke, Taming graphs with no large creatures and skinny ladders

Zoom ID: 869 4632 6610 (ibsdimag)

We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class G there exists a constant k such that no member of G contains a k-creature as an induced subgraph or a k-skinny-ladder as an induced minor, then there exists a polynomial p such that every GG contains at

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.