Skip to content

Erdős Problem #814

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

For \(k\ge2\) and n sufficiently large for the hypotheses to be feasible, an n-vertex graph with at least \((k-1)(n-k+2)+\binom{k-2}{2}+1\) edges must contain an INDUCED subgraph on <=(1-c_k)n vertices with minimum degree >=k, for some fixed c_k>0. This is a statement about induced k-cores and a linear vertex saving, not merely existence of any k-core.

A small example

Take k=3,n=5. The edge threshold is 2(5-1)+1=9. The graph K5 with one missing edge has 9 edges. Removing one endpoint of the missing edge leaves an induced K4 with 4 vertices and minimum degree 3. This checks an instance, not uniform c_k over all n.

What is known

Maintained https://www.erdosproblems.com/latex/814 and web source read 2026-10-14: EFRS [EFRS90] first obtained n-c_k sqrt(n) vertices; Mousset–Noever–Skorić [MNS17] obtained n-c_k n/log n; Lisa Sauermann [Sa19], A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k, JCTB 2019, 36–75, proves full statement with c_k>>1/k^3. The original full proof is not GCL-replayed.

The precise threshold is

\[ e(G)\geq (k-1)(n-k+2)+\binom{k-2}{2}+1. \]

The conclusion asks for an INDUCED subgraph with minimum degree at least \(k\) using no more than \((1-c_k)n\) vertices. Sauermann's result has a saving parameter of order at least \(1/k^3\). Replacing the induced requirement with an arbitrary edge-deleted subgraph would not justify the theorem as stated.

For clarity, the exact edge condition and target vertex saving are

\[ e(G)\geq(k-1)(n-k+2)+\binom{k-2}{2}+1, \]
\[ |V(H)|\leq(1-c_k)n,\qquad \delta(H)\geq k, \]

where \(H\) is an induced subgraph. Sauermann's established source reports a positive \(c_k\) at least of order \(1/k^3\). Earlier savings only grew like \(\sqrt n\) or \(n/\log n\).

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: SAUERMANN_2019_FULL_PROOF_NOT_REPLAYED; C_K_SOURCE_DEPENDENCE_PENDING.

What remains

Verify algebra of the edge threshold and source's feasible n/k conditions, check K5-e example with exact induced minimum degree, and review Sauermann 2019 theorem's dependence on k and n. Do not assert any formally verified c_k numeric coefficient.

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

  • Erdős problem #814, 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 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: #2085 — 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