Skip to content

Erdős Problem #666

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: graph theory.

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

The graph of the \(n\) dimensional cube, called \(Q_n\), has the \(2^n\) binary strings as vertices. Two strings are joined by an edge if they differ in precisely one coordinate. Thus the cube has \(n2^{n-1}\) edges.

Erdős Problem #666 asked whether every subgraph retaining any fixed positive proportion of those edges must contain a cycle of length six, \(C_6\), when the dimension becomes large. The answer is NO, because the edges can be divided into just four subgraphs, each containing no six-cycle.

This is a classical published counterexample by Fan Chung and by Brouwer, Dejter and Thomassen, not a new GCL theorem.

A small example

For \(n=3\), the vertices are binary strings of length three. Start at \(000\) and flip coordinates in the order \(1,2,3,1,2,3\). The successive vertices are

000 → 100 → 110 → 111 → 011 → 001 → 000.

These six distinct intermediate vertices form a genuine \(C_6\) inside the full cube. If one colors each edge according to the coordinate that is flipped, then all edges of any one of the three colors form a matching: no colored class contains a cycle. This finite example helps explain edge coloring, but it uses \(n\) colors in general and therefore does not prove the four-color theorem.

What is known

The 1992 paper of Fan R. K. Chung, Subgraphs of a hypercube containing no small even cycles, Journal of Graph Theory 16, 273–286, explicitly states in its publisher abstract that the cube can always be edge-partitioned into four subgraphs each having no six-cycle. A related construction and four-color assertion also appears in Brouwer, Dejter and Thomassen, Highly symmetric subgraphs of hypercubes, Journal of Algebraic Combinatorics 2 (1993), 25–29.

Why is four a decisive number? If the four edge-disjoint color classes are \(E_1,E_2,E_3,E_4\), then

$$

\sum_{j=1}^4|E_j|=|E(Q_n)|=n2^{n-1}.

$$

At least one class has at least one quarter of the edges. Each class is six-cycle-free by the published theorem, so one of them is a \(C_6\) free subgraph with

$$

|E_j|\geq\frac14n2^{n-1}.

$$

Choose \(\varepsilon=1/4\). Such a subgraph exists for every dimension, contradicting the assertion that every sufficiently large cube subgraph with a fixed positive edge fraction must contain \(C_6\).

The same conclusion holds for smaller positive density parameters. It does not settle all proposed questions about \(C_{2k}\) for \(k>3\); particularly the eight-cycle statements require their own analysis.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: published four color c6 free primary abstract not full proof; external lean not gcl certified. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

For a source-complete article, inspect the primary Chung and Brouwer–Dejter–Thomassen theorem pages and recover the exact four-color rule and proof that none of the four colors has a simple (not necessarily induced) six-cycle. Verify the bound for all \(n\), rather than a finite list.

If formal replay is specifically needed, recover the exact later external Lean proof and full build environment, check its target against the ordinary \(C_6\) condition, and report all imported axioms and proof holes. Otherwise mathematical exposition does not require Codex or Lean.

Then complete accountable editorial review, protected publication, real deployed MathJax inspection and a separate V2 admission.

Sources and claim boundaries

Boundary: published negative resolution plus independently checked averaging, not an internally replayed complete graph-coloring proof or Lean certificate. No new theorem, protected merge, rendered-site verification or editorial admission.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1937 — 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.

Back to catalogue · Compendium introduction