Hole: различия между версиями
Перейти к навигации
Перейти к поиску
KVN (обсуждение | вклад) Нет описания правки |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Hole''' ( дыра) is an odd cycle without diagonals <math>C_{2k+1}</math>, where <math>2k + 1 \geq 5</math>. Its [[Complement of a graph, complementary graph|complement]] is called an '''[[antihole]]'''. A graph is said to be a '''[[Berge graph]]''' if it does not contain '''hole''' and antiholes. | '''Hole''' ( [[дыра]]) is an odd cycle without diagonals <math>C_{2k+1}</math>, where <math>2k + 1 \geq 5</math>. Its [[Complement of a graph, complementary graph|complement]] is called an '''[[antihole]]'''. A graph is said to be a '''[[Berge graph]]''' if it does not contain '''hole''' and antiholes. | ||
Текущая версия от 18:55, 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.