Skip to content

Erdős Problem #797

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

The acyclic chromatic number of a graph is least colors in a proper vertex coloring with no bichromatic cycle. f(d) is maximum of this number among all graphs of maximum degree at most d. Is f(d)=o(d^2)?

The key is to preserve the order of the quantifiers and the exact distinction between a finite example and a theorem about arbitrary large inputs. Replacing an extremum over every admissible set by an extremum over one convenient set would change the problem.

A small example

Cycle C4 has proper 2-coloring but it is bichromatic, hence is NOT acyclic with two colors. A proper three-coloring 1,2,3,2 around its 4 vertices is acyclic because all cycles use three colors. Thus acyclic chromatic number C4=3 while ordinary chromatic number=2.

The calculation illustrates the exact definitions and hypotheses. No single finite example establishes the reported asymptotic assertion.

What is known

Maintained /latex/797 cites N. Alon, C. McDiarmid, B. Reed, Acyclic coloring of graphs, Random Structures & Algorithms (1991), 277–288, whose reported bounds are d^(4/3)/(log d)^(1/3) << f(d) << d^(4/3); hence o(d²). Original full paper not yet proof-inspected in this tranche; no formal certification.

Catalogue status: PROVED. The actual recorded source-audit disposition is SOURCE_LOCK_READY. These are different registers: a historical theorem report does not count as an independent GCL proof.

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: ALON_MCDIARMID_REED_FULL_PRIMARY_PROOF_PENDING.

What remains

Build a simple acyclic-color predicate and brute-force small graphs C4, K3, trees; inspect 1991 original theorem parameter and logarithm. Distinguish maximum degree <=d from equality d, though maxima are equivalent when isolate additions permitted.

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

  • Maintained Erdős Problem #797 and its LaTeX and bibliography, accessed 14 October 2026.
  • Authenticated source return on original GCL issue #2068. Named bibliography and the limits of historical-primary inspection are recorded there.
  • Pinned catalogue: teorth/erdosproblems at 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, original source blob 4e60263a80af6207aca494d2e1388e44fa372889.
  • 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: #2068 — 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