I'd love to know how you spent the first 5 minutes trying to solve these problems:
I'd love to know how you spent the first 5 minutes trying to solve these problems:
4 Comments
Andy J
3/9/2017 06:06:39 pm
Not sure how to count broadly distributed but shallow thinking time, but figured I got enough enjoyment from the problem I owed you a writeup. ^_^
Reply
Andy J
3/9/2017 07:26:55 pm
The next five internetenabled minutes spent on the problem were more productive, though one wonders in retrospect whether turning sagemath loose on Q2 may have been overkill.
Reply
Danny
3/10/2017 02:26:44 pm
Thanks for these reflections Andy! I hadn't thought about your way of doing Q1, so thanks for that.
Reply
Andy J
3/11/2017 07:39:12 am
Indeed: the unique graph with degree sequence [3,3,4,4,5,5] is planar and 3connected, so its dual can be embedded as a convex polyhedron satisfying your condition. Assuming I didn't mistranscribe, a clockwise embedding around each face is Leave a Reply. 
