New blog post: Eberhard's theorem for bipartite polyhedra with one big face, https://11011110.github.io/blog/2020/09/07/eberhards-theorem-bipartite.html
Or, if you want to build a simple polyhedron given one 2n-gon face and a fixed number of quadrilaterals, but an unlimited number of hexagons, what's the fewest hexagons you need to use?
Mastodon is the best way to keep up with what's happening.
Follow anyone across the fediverse and see it all in chronological order. No algorithms, ads, or clickbait in sight.