Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Room B232 IBS (기초과학연구원)Given a graph $G$, we define $\textrm{ex}_c(G)$ to be the minimum value of $t$ for which there exists a constant $N(t,G)$ such that every $t$-connected graph with at least $N(t,G)$ …