Papalocal
Loading…
Papalocal · Things
Work

Kuratowski's theorem

Kuratowski's theorem is a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃. It came out in 1930.

Released
1930
All 5 facts, and where they come from

Facts

5 facts · 0 confirmed by two sources · 0 cited · 5 from one source

What it is
theorem One source
forbidden graph characterization One source
Released
1930 One source
Named after

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2550089149
Described as
a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃
What it is
theorem; forbidden graph characterization · 1 reference
Released
1930
Named after
Kazimierz Kuratowski; Lev Pontryagin
Wikipedias with a page
15

Wikidata item Q837902 (wikidata.org/wiki/Q837902), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1369859465

In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K5 (the complete graph on five vertices) nor of K3,3 (a complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph).

From the Wikipedia article “Kuratowski's theorem” (en.wikipedia.org/wiki/Kuratowski's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

Picture: Wikimedia Commons: Forbys planar graphs example.png · See Commons file page

People connected 1

Known for it