Skip to content

Erdős Problem #833

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: graph theory, hypergraphs, 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

A hypergraph requiring three vertex colors cannot have all its edges spread too thinly among the vertices. Erdős and Lovász established an exponential lower bound for a necessary high-degree vertex, resolving the qualitative exponential question without computing every exact small-uniformity value.

For r>=2, an r-uniform hypergraph with chromatic number EXACTLY 3 must have some vertex degree at least c_r 2^r/r, and hence at least (1+c)^r for some absolute c>0 for sufficiently large r. f(r) is the greatest integer guaranteed as maximum vertex degree among all such hypergraphs; the existence of a universal exponential lower bound is proved, but exact f(r) need not be determined.

A small example

For r=3, the Fano plane has seven edges and each vertex lies in exactly three; its chromatic number is 3, so it witnesses maximum degree exactly three for that example. For r=2, a triangle has chromatic number 3 and maximum degree two.

This finite calculation is not an asymptotic or all-parameter proof.

What is known

Maintained /latex/833 directly read 2026-10-14. Erdős–Lovász [ErLo75], Problems and results on 3-chromatic hypergraphs and some related questions (1975) pp609–627 prove a vertex of degree at least 2^(r-1)/(4r). It reports f(2)=2 and f(3)=3; exact f(4) is NOT resolved by the stated exponential lower bound. No original full theorem-proof replay yet.

Erdős and Lovász's source-reported vertex-degree guarantee is

\[ \Delta(H)\geq\frac{2^{r-1}}{4r}. \]

For sufficiently large r, this exceeds (1+c)^r for some fixed positive c because the numerator grows like 2^r and the denominator is only linear in r. The Fano plane provides a finite three-uniform, three-chromatic witness that is regular of degree three.

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: ERDOS_LOVASZ_1975_FULL_PROOF_PENDING; F4_EXACT_VALUE_NOT_ESTABLISHED.

What remains

Reconstruct finite Fano witness and triangle, source-read Erdős–Lovász proof and precise minimum/range; distinguish proof of exponential positive answer from full exact determination of f(r).

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 #833, LaTeX/bibliography and authenticated issue source return, checked 14 October 2026.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. Original papers and unresolved proof obligations are identified in the source comment.
  • 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: #2104 — 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