Summary
Full Transcript
This video is a deeper look at bipartite graphs. We look at both the definition of a bipartite graph and using graph coloring to determine if an existing graph can be redrawn as bipartite. In addition, we model real-life scenarios with bipartite graphs in an effort to create a complete matching and explore Hall's Marriage Theorem to determine if a complete matching is possible. Video Chapters: Intro 0:00 What is a Bipartite Graph/Redrawing with Graph Coloring 0:12 Bipartite Graph Matching 7:12 Graph Matching Practice 9:48 Hall's Marriage Theorem 12:08 Up Next 15:47 This playlist uses Discrete Mathematics and Its Applications, Rosen 8e Power Point slide decks to accompany the videos can be found here: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
