Skip to content

Erdős Problem #761

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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

Define χ(G) as graph chromatic number, ζ(G) as the cochromatic clique-or-independent partition number, and δ(G) as the maximum, over orientations of G's edges, of the minimum number of colours needed so that NO colour class contains a directed cycle. Erdős–Neumann-Lara ask whether large χ forces large δ; Erdős–Gimbel ask whether large ζ forces the existence of a subgraph with large δ. Both are OPEN in the maintained source. A positive answer to the second would imply a positive answer to the first using the known #760 relation.

A small example

Any orientation of a forest is acyclic, so δ(G)=1 for every forest even when G has edges and χ(G)=2. For a triangle K3, orient the three edges cyclically: one colour creates a directed three-cycle, but two colours suffice; hence δ(K3)=2. A transitive orientation of K3 is acyclic, illustrating why δ maximizes over orientations. These small graphs do not settle whether δ can stay bounded while χ or ζ grows without bound.

What is known

The dichromatic number of a directed graph measures partition into acyclic vertex classes. The maintained #761 describes the undirected graph parameter as 'for any orientation there exists a k-colouring into acyclic classes', i.e. a worst-orientation bound; confusing this with an easier 'there exists an orientation' parameter would trivialize the question by orienting edges according to a vertex order. The source notes #760 connects χ to ζ on a subgraph and attributes the two questions to Erdős–Neumann-Lara and Erdős–Gimbel [ErGi93]. No source-grounded general solution or protected FC #761 theorem was found.

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: dichromatic worst orientation two questions open; neumann lara vs gimbel separate. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Formalize the minimax quantifier order for δ(G), prove exact forest δ=1 and K3 δ=2, and investigate whether a bounded-dichromatic family can have unbounded cochromatic number in the subgraph sense. Source-lock ErGi93 original wording and #760 implication.

Sources and claim boundaries

Maintained #761; authenticated source report. Full original theorem proof/source pages pending. no new independent primary theorem certification, public-browser mathematical rendering or V2 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: #2032 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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