Skip to content

Erdős Problem #803

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

A graph H is D-balanced when its maximum vertex degree is at most D times its minimum degree (so a meaningful positive-minimum-degree convention is required). Erdős and Simonovits asked whether every sufficiently dense n-vertex graph with >=n log n edges contains, for arbitrary target size m, a uniformly O(1)-balanced m-vertex subgraph with Omega(m log m) edges.

A D-balanced graph has largest degree at most D times its smallest positive degree. Alon's counterexamples invalidate the hoped-for logarithmic edge density. Janzer and Sudakov's later existence theorem recovers a weaker square-root-of-logarithm density. One should not compare the constants in these bounds without retaining their different quantifiers.

A small example

The three-leaf star K1,3 has maximum degree three and minimum degree one, so it is 3-balanced, not 2-balanced. A triangle is 1-balanced. An isolated vertex produces minimum degree zero, requiring explicit convention: it must not be used to argue a meaningful bounded degree ratio.

This finite fixture tests the conventions. It does not certify any of the asymptotic or all-graphs assertions.

What is known

Maintained #803 cites Alon [Al08], Problems and results in extremal combinatorics II (Discrete Math. 2008) showing a counterexample for every fixed D>1: D-balanced H has O(m sqrt(log m)+log D) edges in some host graphs having >=n log n edges. Janzer–Sudakov [JaSu23], Resolution of the Erdős–Sauer problem on regular subgraphs (Forum Math Pi 2023), guarantees only Omega_k(m sqrt(log m)/(loglog m)^(3/2)) for m>=k. Registry DISPROVED correct for original log m goal. Proof bodies not independently reproduced.

The distinctions between established partial theorems, original open parts, and disproved universal claims have been preserved. Historical publications are attributed, rather than presented as new GCL mathematics.

For a fixed balance parameter \(D>1\), the recorded obstruction limits the edge count in the counterexample's balanced \(m\) vertex subgraphs to an expression of order

\[ m\sqrt{\log m}+\log D. \]

For fixed \(D\), this is smaller than the originally demanded order \(m\log m\). The positive Janzer–Sudakov result has a different scope and weaker bound.

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: ALON2008_AND_JANZER_SUDAKOV2023_FULL_PRIMARY_PROOFS_PENDING.

What remains

Verify Alon theorem upper-bound constants and dependence on D from printed original; verify Janzer–Sudakov 2023 exact k/m thresholds and that their result does not imply m log m. Build finite D-balance fixture on triangle, star, isolated vertex.

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

  • Erdos problem #803 and maintained source and bibliography, retrieved by web search 14 October 2026.
  • Authenticated issue-bound return for #803, preserving source limitations and open proof obligations.
  • Pinned teorth/erdosproblems repository revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, source blob 4e60263a80af6207aca494d2e1388e44fa372889. No protected source lock was silently changed.
  • 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: #2074 — 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