Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Fowler, Leonard"'
Publikováno v:
Involve 16 (2023) 505-518
We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we give an ex
Externí odkaz:
http://arxiv.org/abs/2204.10134
