Graph Theory: 08-a Basic Problem Set (part 1/2)

Описание к видео Graph Theory: 08-a Basic Problem Set (part 1/2)

Here we provide solutions to a basic problem set in Graph Theory. This part 1 of 2 answers the following:
1) Prove that the number of edges is a simple graph is at most nC2 (ie "n choose 2") and determine when equality holds.
2) Prove that paths are bipartite.
--An introduction to Graph Theory by Dr. Sarada Herke.

Links to the related videos:
   • Graph Theory: 08-b Basic Problem Set ...   - Graph Theory: 08-b Basic Problem Set (part 2/2)
   • Graph Theory: 05. Connected and Regul...   - Graph Theory: 05. Connected and Regular Graphs

For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" -    / spoonfulofmaths  

Комментарии

Информация по комментариям в разработке

Похожие видео