Zarankiewicz problem

Source placement record

Zarankiewicz problem: how many edges can there be in a bipartite graph on a given number of vertices with no complete bipartite subgraphs of a given size?

Here is what the pinned source says, where it came from, and what still needs editorial review.

Source status: Open
Field: Graph theory · Subgraphs
Record type: Revision-pinned source placement
Verification: Source-index reviewed
Source grade: secondary
Reviewed: 2026-07-27T18:04:33.834Z

Context and review boundary

The source list does not provide a uniform standalone exposition for every row. Use the exact subsection and linked topic article as the starting point for a reviewed reading trail.

Formal boundary

No independent formal statement has been added to this source-index record. This prevents the catalog from inventing notation or silently strengthening the cited claim.

Known approaches and partial results

Pending review. No structured approach or partial-result note has been added to this source placement.

Source trail

Wikipedia list subsection — Exact Graph theory › Subgraphs subsection in the revision-pinned source.
Wikipedia topic article — Background article linked by the source index; follow its references for deeper study.
Pinned source revision 1366281547 — Revision-pinned snapshot from 7/27/2026.