Skip to content

Erdős Problem #801

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

If n-vertex G has independence number alpha(G)<=sqrt n (no independent set larger), then there exists vertex subset S of size <=sqrt n spanning >=c sqrt n log n edges for an absolute positive constant c, for sufficiently large n. Need clarify floors and asymptotic meaning.

Scope check: count only edges with both endpoints inside the selected vertex set, not the degrees of selected vertices into the full graph. Asymptotic absolute constants and integer rounding need primary-source verification.

A small example

For K9, alpha=1<=3. A 3-vertex subset contains 3 edges, illustrating local density but not estimating the asymptotic constant c. For an empty graph on nine vertices alpha=9, so premise fails. The target is induced edges, not total degrees from the chosen vertices into the rest.

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

What is known

Maintained /latex/801 cites Noga Alon, Independence numbers of locally sparse graphs and a Ramsey type problem, Random Structures & Algorithms (1996), 271–278, as proving claim. Full original proof and exact range/constant n not yet inspected; use catalogue claim not independent 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_1996_FULL_PRIMARY_PROOF_PENDING.

What remains

Finite graph edge-count fixture on K9 and an empty graph; source lock Alon 1996 exact statement and check induced subgraph versus incident edge quantifier and big-Omega constant.

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