Abstract:This is an analysis of the status of Brooks' Theorem, a celebrated result in graph coloring, from the point of view of Reverse Mathematics. We prove that the restriction of Brooks' theorem to bounded graphs of degree greater than or equal to $3$ is provable in $\mathsf{RCA}_0$, while the statement for arbitrary graphs is equivalent to $\mathsf{WKL}_0$ over $\mathsf{RCA}_0$. Brooks' Theorem for degree $2$, even when restricted to bounded graphs, is equivalent to $\mathsf{WKL}_0$ over $\mathsf{RCA}_0$.
From: Alberto Marcone [view email]
[v1]
Wed, 7 Jan 2026 15:11:24 UTC (29 KB)
[v2]
Sun, 2 Aug 2026 19:39:12 UTC (27 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。