Bruce A. Reed, Some Variants of the Erdős-Sós Conjecture
Room B332 IBS (기초과학연구원)Determining the density required to ensure that a host graph G contains some target graph as a subgraph or minor is a natural and well-studied question in extremal combinatorics. The celebrated 50-year-old Erdős-Sós conjecture states that for every k, if G has average degree exceeding k-2 then it contains every tree T with k vertices …