加载中…
We show that every planar graph has a 2-fold 9-coloring. In particular, this implies that has fractional chromatic number at most . This is the first proof (independent of the 4 Color Theorem) that there exists a constant such that every planar has fractional chromatic number at most .

生成讲解博客的中文版本

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