Skip to main content
2 of 2
replaced http://mathoverflow.net/ with https://mathoverflow.net/

Already for $d=3$ the boundary complex of the cyclic polytope with n vertices has a complete graph and hence requires $n$ colors.

You may ask if restricting the class of triangulations can lead to interesting extension of the FCT. Some answers in Generalizations of the four-color theorem are relevant.

Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327