Erdős Problem #842
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: graph theory, chromatic number.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Disjoint triangles are connected by a Hamiltonian cycle whose edges are all new. Coloring every triangle alone is straightforward, but it is not obvious that the cycle can be accommodated with just three vertex colors. Fleischner and Stiebitz proved that it can.
Take n disjoint triangles on 3n vertices and add a Hamiltonian cycle all of whose edges are NEW (distinct from triangle edges). Must the resulting simple graph be 3-vertex-colorable? Yes for every admissible graph, not only a particular cycle. For n=1, no Hamilton cycle exists with all its edges new, so the domain is configurations satisfying that condition.
A small example
For n=2 take vertex triples (0,1,2), (3,4,5). The Hamilton cycle 0–3–1–4–2–5–0 uses only cross-triangle edges. Proper three-coloring, for example assign 0,1,2 colors 0,1,2 and 3,4,5 colors 2,0,1, so all six cross-cycle edges receive different endpoint colors.
A finite instance tests the definition, not a claim quantified over every large graph, infinite set or arbitrary coloring.
What is known
Maintained https://www.erdosproblems.com/latex/842, read 2026-10-14, reports Fleischner–Stiebitz [FlSt92], A solution to a colouring problem of P. Erdős, Discrete Mathematics (1992), 39–48 proved YES. Their full primary proof not independently replayed. This is the famous cycle-plus-triangles coloring problem; do not generalize arbitrary union of 3-regular graphs or edge-overlapping cycles.
Three colors are necessary because each original triangle is a clique of order three. The Fleischner–Stiebitz theorem says they are always sufficient. For a six-vertex example, two triangles (0,1,2) and (3,4,5) with cross-triangle cycle 0-3-1-4-2-5-0 admit colors (0,1,2) and (2,0,1) respectively. That verifies one configuration, not the global theorem.
GCL's current state
The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.
Unclosed mathematical proof/source qualifications: FLEISCHNER_STIEBITZ1992_FULL_PROOF_NOT_REPLAYED.
What remains
Create exact graph and 3-coloring oracle for six vertices and validate cycle disjointness from the triangle edges. Source-audit 1992 original proof and scope, preserve YES with attributed proof only.
For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.
Sources and claim boundaries
- Erdős problem #842 and maintained LaTeX/bibliography, read 14 October 2026.
- Authenticated source-audit return, including original historical bibliography and source proof limitations.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. External proofs not independently GCL certified.
- Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2113 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.