2018/09/11 by Yiting Jiang, Jiang, Yiting, Xuding Zhu +1
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1809.03665
openalex publication_date 2018/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proves that for each positive integer m, there is a triangle-free planar graph G which is not (3m+ \lceil \frac m17 \rceil-1, m)-choosable.