Thursday, September 19, 2019 @ 4:30 PM - 5:30 PM KST Cory Palmer, A survey of Turán-type subgraph counting problems Room B232 IBS (기초과학연구원) Let F and H be graphs. The subgraph counting function ex(n,H,F) is defined as the maximum possible number of subgraphs H in an n-vertex F-free graph. This function is a … Continue Reading