Erdős Problem #1216
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: disproved (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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1216 currently has source status DISPROVED — DIRECTED RAMSEY LOWER IMPROVED.
For a tournament (orientation of every edge of \(K_n\)), let \(f(n)\) be the largest \(t\) guaranteed in every tournament such that it contains a transitive subtournament on \(t\) vertices, equivalently a tournament with no directed triangle. The proposed exact formula was \(f(n)=\lfloor\log_2n\rfloor+1\). An improved lower bound strictly exceeding this value for sufficiently large \(n\) disproves the proposed equality; it does not determine the true exact \(f(n)\) for all \(n\).
A small example
Exhaustive enumeration of every tournament on \(n=3,4,5\) vertices (respectively \(2^3,2^6,2^{10}\) orientations) computes, for each, its largest transitive subtournament and then minimizes over tournaments. The resulting exact guaranteed sizes are included in phase25 receipt. This small enumeration checks the basic definition; it cannot certify Reid–Parker's general improved inequality.
What is known
Stearns [St59] proved \(f(n)\ge\lfloor\log_2n\rfloor+1\) via a vertex of out-degree at least \((n-1)/2\), while Erdős–Moser [ErMo64] gave upper \(f(n)\le2\lfloor\log_2n\rfloor+1\). Reid–Parker [RePa70] DISPROVED exact equality for \(n\ge14\), proving a stronger lower bound \(\lfloor\log_2n+4-\log_27\rfloor\). Sánchez-Flores [Sa94],[Sa98b] improved bounds for \(n\ge55\), then \(n\ge32\). Maintained https://www.erdosproblems.com/1216 reports \(f(7)=3\), consistent with the original equality at some small values. Source proofs remain independently unreviewed.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Read RePa70 and Sánchez-Flores original threshold conditions, confirm 'for all \(n\ge14\)' and exact floor placement, and independently verify the small tournament exhaustive search. Distinguish disproval of the sharp logarithmic equality from uncertainty about the actual extremal function.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1216 ; [ErMo64],[St59],[RePa70],[Sa94],[Sa98b].
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2487 — 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.