16 Mar
2016
16 Mar
'16
1:29 p.m.
clockwise ordering... We might indeed then argue that all the two-graphs are eliminated except perhaps for a very small finite set, whereupon the answer to Conway's question is "the empty set" or perhaps {5}, {9}, or {5,9} but I can't believe it could be more.
--sorry, forgot to add 1; hence meant {}, {6}, {6,10}, or {10}. That is, 6 and 10 are the two smallest elements in Taylor's set. So I can't help suspecting that Conway may have overlooked some implications of his problem C wording. Anyhow, it is strange if they are not posting solutions. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)