آپلود ویدئو | ورود | ثبت نام


آرش-

Graph Theory: 66. Basic Bound on the Chromatic Number


Embed گزارش تخلف

مشاهده 1284

دریافت ویدئو: حجم کم کیفیت بالا
توسط آرش در 23 Jul 2016
توضیحات:

In this video we prove by induction that every graph has chromatic number at most one more than the maximum degree. Odd cycles and complete graphs are exampl...

لغات کلیدی:

Mathematics, Math, Maths, Advanced Mathematics, Graph Theory, Combinatorics, Discrete Mathematics, Graduate, University, College, Education, Lecture, Graph C...


comments powered by Disqus

درباره ما | تماس با ما | قوانین تخته سفید