Lower bounds on chromatic number, perfect graphs. MA252, University of Warwick, Week 6, Lecture 3
Автор: Jonathan Noel
Загружено: 2021-01-10
Просмотров: 78
Описание:
This is the third lecture on Vertex Colouring from the course MA252 Combinatorial Optimization taught by Jonathan Noel at the University of Warwick. The topic is lower bounds on the chromatic number and perfect graphs. The original date of this lecture was February 13, 2019.
Additional materials for this course can be found on an archived version of the course webpage: https://www.math.uvic.ca/~noelj/MA252...
This content belongs to the University of Warwick. It is shared under a CC BY-SA 2.0 License. Please acknowledge the University of Warwick in any redistribution or reuse of any part of this content.
An effort has been made to eliminate any personal information of students from this video. If you find any such information, then please contact me at [email protected] so that I can resolve this issue.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
