Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I only use the fact that TSP has no constant factor approximation. You can prove this using the PCP theorem (en.wikipedia.org/wiki/PCP_theorem), although that is overkill.
According to Ziegler's Lectures on Polytopes, this is an open question. However, for simplicial polytopes, the answer is yes. See this MO question: mathoverflow.net/questions/129677/…
