Erdős Problem #533
Editorial depth: Reference entry — substantive explanation pending source review.
Snapshot classification: disproved (not automatically the live result).
Subject areas: graph 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
The precise mathematical question has not yet been editorially paraphrased or reviewed for this entry. Read the original question and its references rather than rely on an invented synopsis.
A small example
A checked illustrative example has not yet been prepared.
What is known
The pinned catalogue records disproved. This label must be reconciled against the dated primary literature before it is treated as a current mathematical conclusion.
GCL's current state
GCL classifies this item as OUTSIDE_STRICT_OPEN_TRIAGE. Its protected source-audit task is the current research-evidence entry point. An available task is not proof that an independent agent has begun work.
What remains
Capture the exact theorem statement, a readable worked example, the strongest dated source result, a falsifiable mathematical boundary, and an independently checked account of GCL progress. Until those steps are done, this is an indexed source reference, not a completed explainer.
Sources and claim boundaries
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1804 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.