An Asymptotically Tight $t\log t$ Bound for $k$-Connected Subgraphs in Dense $K_t$-Minor-Free Graphs

Xinheng Lin

Delcourt and Postle reduced the Linear Hadwiger Conjecture to coloring $K_t$-minor-free graphs on $O(t{\log }^{4}t)$ vertices. An important theorem in their proof process asserts that…