We prove that every planar triangle-free graph on nn vertices has fractional chromatic number at most 3−1n+1/33−n+1/31.
生成讲解博客的中文版本
生成AI智能校验的中文版本