Zarankiewicz problem

E1874325 UNEXPLORED

The Zarankiewicz problem is a central question in extremal graph theory that seeks the maximum number of edges a bipartite graph can have without containing a given complete bipartite subgraph.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Zarankiewicz problem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Turán's theorem → relatedTo → Zarankiewicz problem ⓘ