Berge's conjecture

Материал из WikiGrapp
Перейти к:навигация, поиск

Berge's conjectureгипотеза Бержа.

In 1960, C.Berge conjectured that a graph is perfect iff none of its induced subgraphs is a \,C_{2k+1} or the complement of such a cycle, k \geq 2.

This conjecture is well-known as the Strong Perfect Graph Conjecture and is still open.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.