Answers are grounded in this paper and cite their sources.
We provide two proofs of a theorem due to Baxter on the four-coloring of a cubic planar graph. We then consider an n-dimensional version of Baxter's theorem and relate it to Sperner's lemma.
No takes yet. Share an insight, caveat, or question.
Richard Ehrenborg (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: