Maya Sankar, Homotopy and the Homomorphism Threshold of Odd Cycles

Zoom ID: 224 221 2686 (ibsecopro)

Fix r2 and consider a family F of C2r+1-free graphs, each having minimum degree linear in its number of vertices. Such a family is known to have bounded chromatic number; equivalently, each graph in F is homomorphic to a complete graph of bounded size. We disprove the analogous statement for homomorphic images that

Maya Sankar, The Turán Numbers of Homeomorphs

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

Let X be a 2-dimensional simplicial complex. Denote by exhom(n,X) the maximum number of 2-simplices in an n-vertex simplicial complex that has no sub-simplicial complex homeomorphic to X. The asymptotics of exhom(n,X) have recently been determined for all surfaces X. I will discuss these results, as well as ongoing work bounding exhom(n,X) for arbitrary 2-dimensional

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.