Asymptotic Density of Graphs Excluding Disconnected Minors

Rohan Kapadia, Sergey Norin, Yingjie Qian

For a graph $H$, let $$c_{\infty }(H)=\underset{n\to \infty }{\lim }\max \frac{|E(G)|}{n},$$ where the maximum is taken over all graphs $G$ on $n$ vertices not containing $H$ as a minor. Thus…