Construct · 1 fields · 1 citations

Kuratowski's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Kuratowski'stheorem1 CONSTRUCTKuratowski's theoremKURATOWSKI · GRAPH THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the characterization that a finite graph is planar exactly when it contains no subdivision of the complete graph K5 or the complete bipartite graph K3,3.

In graph theory, Kuratowski's theorem refers to the characterization that a finite graph is planar exactly when it contains no subdivision of the complete graph K5 or the complete bipartite graph K3,3. This meaning comes from Kuratowski (1930) in Fundamenta Mathematicae.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Kuratowski's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

References

  1. Kuratowski, C. (1930). Sur le problème des courbes gauches en Topologie. Fundamenta Mathematicae, 15, 271-283. https://doi.org/10.4064/fm-15-1-271-283

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct