Independence numbers of polyhedral graphs

Sébastien Gaspoz, Riccardo W. Maffucci

A polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive in…