加载中…
We give a combinatorial proof that every simple convex -polytope admits a small cover without using the Four Color Theorem. We also prove that the assertion that every simple plane triangulation admits a mod~ characteristic function with at most five values is equivalent to the Four Color Theorem.

生成讲解博客的中文版本

生成AI智能校验的中文版本