Skip to content

Erdős Problem #799

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

List chromatic number chi_L(G) is smallest k such that EVERY assignment of length-k color lists to vertices permits a proper choice from each list. For random G(n,1/2), is chi_L(G)=o(n) with high probability? Random graph model must not be interpreted as every graph.

Scope check: asymptotically almost surely for G(n,1/2) is not the same as a bound that holds for every n-vertex graph. The definition of list coloring additionally quantifies over every equal-size list assignment.

A small example

For the triangle K3, chi_L=3: identical two-color lists on all vertices cannot color it, while any three-element lists do via Hall's marriage theorem. An edgeless graph has chi_L=1 even with different singleton lists, providing a definitional contrast.

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

What is known

Maintained /latex/799 attributes Alon 1992 upper chi_L << n loglog n/log n a.a.s., improved to chi_L asy n/log n a.a.s. by Alon–Krivelevich–Sudakov 1999, Combinatorica 453–472. Original theorem statements not directly proof-inspected; preserve random probability and list-universal quantifiers.

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_AKS_FULL_PRIMARY_PROOF_PENDING.

What remains

Finite exhaustive list assignments for triangle and four-cycle from small palette; check the upper/lower probabilistic statements on the original 1992/1999 texts, no general deterministic o(n) assertion.

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 #799 and its LaTeX and bibliography, accessed 14 October 2026.
  • Authenticated source return on original GCL issue #2070. 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: #2070 — 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