Jump to content

Kazimierz Kuratowski

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by PierreAbbat (talk | contribs) at 14:58, 26 March 2002 (start). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Kazimierz Kuratowski was a graph theorist who proved that all nonplanar graphs contain a subgraph that, by joining edges that meet in points of degree 2, can be reduced to K5 (a pentagram inside a pentagon) or K3,3 (three odd points each of which is joined to all of three even points).