Skip to content

Erdős Problem #807

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

The bipartition number tau(G) is the MINIMUM number of EDGE-DISJOINT complete bipartite subgraphs whose edge sets partition E(G). alpha(G) is size of largest edgeless vertex set. Conjecture: for G(n,1/2) almost surely tau(G)=n-alpha(G).

The biclique count is an EDGE PARTITION parameter. Graph edges cannot be counted twice among the complete bipartite pieces. The proposed almost-sure equality with n-alpha is disproved, and a stronger multiplicative improvement in alpha is known for random graphs.

A small example

K4 has alpha=1; it admits a partition into three stars: edges from vertex 1 to {2,3,4}, then from vertex 2 to {3,4}, then edge {3,4}. Thus tau(K4)<=3=n-alpha(K4). This deterministic example is not contradictory to the random-graph asymptotic negative result.

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

What is known

Maintained #807 DISPROVED: Alon [Al15] proved random graphs almost surely tau(G)<=n-alpha(G)-1; Alon–Bohman–Huang [ABH17] stronger tau(G)<=n-(1+c)alpha(G) for absolute c>0. Crucial distinction edge PARTITION (disjoint edges), not cover with repetitions. Original proofs pending review.

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.

Alon, Bohman, and Huang strengthen the negation of the original equality with the almost-sure estimate

\[ \tau(G)\leq n-(1+c)\alpha(G), \]

where \(c>0\) is absolute. This is an asymptotic probability statement about \(G(n,1/2)\), not a pointwise statement for arbitrary graphs.

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: ALON2015_AND_ABH2017_FULL_PROOFS_PENDING; EDGE_PARTITION_NOT_COVER.

What remains

Enumerate finite complete-bipartite edge sets on four vertices, solve minimal exact partition for K4 and a path, test edge-disjoint requirement, and independently audit random-graph almost-sure/absolute-c statements of Alon 2015 and ABH 2017.

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 #807 and maintained source and bibliography, retrieved by web search 14 October 2026.
  • Authenticated issue-bound return for #807, 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: #2078 — 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