Kuratowski's theorem: различия между версиями

Kuratowski's theorem (посмотреть исходный код)

44 байта добавлено , 23 октябрь

нет описания правки

1146

правок

@@ Строка 1: / Строка 1: @@
-'''Kuratowski's theorem''' --- теорема Куратовского.
+'''Kuratowski's theorem''' --- [[теорема Куратовского]].
-'''Theorem'''. A graph <math>G</math> is planar iff it does not contain a
+'''Theorem'''. A graph <math>G</math> is planar iff it does not contain a ''subdivision'' of <math>K_{5}</math> and <math>K_{3,3}</math>, i.e. iff it does not contain the ''minors'' <math>K_{5}</math> and <math>K_{3,3}</math>.
-''subdivision'' of <math>K_{5}</math> and <math>K_{3,3}</math>, i.e. iff it does not
-contain the ''minors'' <math>K_{5}</math> and <math>K_{3,3}</math>.
-The other name is '''Pontrjagin-Kuratowski's theorem'''.
+The other name is '''[[Pontrjagin-Kuratowski's theorem|''Pontrjagin-Kuratowski's theorem'']]'''.