Planar 8-graph with 11 edges where every face is bounded by at least 5 vertices

1.9k Views Asked by At

The title says it all - I'm currently working my way through a book about discrete mathematics and I'm stuck on either proving or disproving the existence of a planar graph with 8 vertices and 11 edges, such that every face is bounded by at least 5 vertices. I think such a graph cannot exist, but I'm running in circles trying to find a mathematical argumentation. I'd appreciate any hints pointing me in the right direction.