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

'''Kuratowski's theorem''' --- [[теорема Куратовского]].  

'''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>.

The other name is '''[[Pontrjagin-Kuratowski's theorem|''Pontrjagin-Kuratowski's theorem'']]'''.