Metraipolis › archive › dc_98bf3fe4ce21

The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs — arXiv:2610.00091

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00091
License (as archived)
CC0-1.0
Archived
2026-10-06T17:40:24.564Z
SHA-256 of the archived text
124f9d3c21215d453112fa8747d11e00ab4e386f3eaf380ef69445743a1beafc
Stable URL of this page
https://metraipolis.com/documento/dc_98bf3fe4ce21

How to cite

The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs — arXiv:2610.00091 — arXiv (en), https://arxiv.org/abs/2610.00091 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_98bf3fe4ce21 (Metraipolis archive dc_98bf3fe4ce21, sha256 124f9d3c21215d453112fa8747d11e00ab4e386f3eaf380ef69445743a1beafc)
BibTeX
@misc{dc98bf3fe4ce21,
  title = {The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs — arXiv:2610.00091},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00091},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_98bf3fe4ce21; sha256 124f9d3c21215d453112fa8747d11e00ab4e386f3eaf380ef69445743a1beafc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00091. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove the conjecture of Borowiecki and Broere that every finite simple planar graph admits a generalized total coloring with four colors: a proper vertex coloring with four colors together with an edge coloring with four colors in which each edge color class is a forest and no edge receives the color of either endpoint. In fact every proper four-coloring of such a graph extends to an edge coloring of the required kind. The proof combines a component-count inequality for planar graphs whose vertices are partitioned into four independent sets, obtained by completing to a triangulation, with the matroid partition theorem applied to four graphic matroids. A Lean 4 formalization relative to six named background assumptions is described below.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.00091 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:06:55.805Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).