10 May
2016
10 May
'16
6:56 p.m.
Allan Wechsler is of course correct, K-regular matchstick graphs exist with 2^K vertices and graphically the same as the K-cube. (if edge-crossings allowed.) These evade my degree of freedom counting argument because his graph drawings "really" have very few, about 2K or fewer, degrees of freedom.