Hole: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Hole''' --- дыра. An odd cycle without diagonals <math>C_{2k+1}</math>, where <math>2k + 1 \geq 5</math>. Its ''complement'' is called an '''antihole'''. A …»)
 
Нет описания правки
Строка 1: Строка 1:
'''Hole''' --- дыра.
'''Hole''' ( дыра) is an odd cycle without diagonals <math>C_{2k+1}</math>, where <math>2k + 1 \geq 5</math>. Its ''complement'' is called an '''[[antihole]]'''. A graph is said to be a '''[[Berge graph]]''' if it does not contain '''hole''' and antiholes.
 
An odd cycle without diagonals <math>C_{2k+1}</math>, where <math>2k + 1 \geq 5</math>. Its
''complement'' is called an '''antihole'''. A graph is said to be a
'''Berge graph''' if it does not contain '''hole''' and antiholes.

Версия от 18:52, 19 октября 2024

Hole ( дыра) is an odd cycle without diagonals [math]\displaystyle{ C_{2k+1} }[/math], where [math]\displaystyle{ 2k + 1 \geq 5 }[/math]. Its complement is called an antihole. A graph is said to be a Berge graph if it does not contain hole and antiholes.