Skip to content

Erdős Problem #813

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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

Define h(n) as the MINIMUM possible clique number among n-vertex graphs for which EVERY set of seven vertices contains a triangle. Estimate h(n), in particular ask whether there are fixed c1,c2>0 with n^(1/3+c1)<<h(n)<<n^(1/2-c2). The local seven-set hypothesis is universal; it is vacuous for n<7.

A small example

For n=7, the complete graph K7 has the every-seven-set triangle property and clique number 7. K7 with one edge missing also satisfies the property but clique number is 6. Testing a single seven-set cannot determine h(n) or the asymptotic exponents.

What is known

Maintained https://www.erdosproblems.com/latex/813, read 2026-10-14: Erdős–Hajnal proved n^(1/3)<<h(n)<>n^(5/12-o(1)). This is strong positive movement on the lower side but does not prove the proposed fixed power saving below n^(1/2). Original paper proof and exact exponent uniformity uninspected.

The newer lower bound \(h(n)\gg n^{5/12-o(1)}\) lies between the historical scales \(n^{1/3}\) and \(n^{1/2}\). A result at exponent \(5/12-o(1)\) supplies a fixed positive improvement above \(1/3\) but no corresponding fixed-exponent improvement below the recorded upper exponent \(1/2\). Every seven-set, not merely some seven-set, must contain a triangle.

The historical and newer bounds, in their reported asymptotic senses, are

$$

n^{1/3}\ll h(n)\ll n^{1/2}, \qquad h(n)\gg n^{5/12-o(1)}.

$$

The newer lower exponent is strictly greater than one third, but the upper comparison with one half remains unresolved at the requested fixed-power level.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: open seven vertex triangle local global clique. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Write a finite graph oracle to test all 7-subsets contain some triangle, compute clique number for K7 and K7-e. Inspect full Bucić–Sudakov original theorem and the original EH upper construction; preserve the difference between n^(5/12-o(1)) and n^(5/12+c).

Critical review must independently verify the original primary theorem, hypotheses, quantitative constants and simple examples. Passing source tests does not establish publication or mathematical proof certification.

Sources and claim boundaries

  • Erdős problem #813, maintained LaTeX and original authenticated source return, checked 14 October 2026.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, Git blob 4e60263a80af6207aca494d2e1388e44fa372889. The source comment contains original bibliography and limits of direct proof inspection.
  • Editorial acceptance: NONE. Protected merge: NONE. Real-browser MathJax: NOT VERIFIED. Lean/new theorem certification: NOT CLAIMED.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2084 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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