Chapter
Robinson and Seymour's Theorem and Graph Theory
1:01:12 - 1:10:08 (08:55)
Robinson and Seymour's theorem states that every class of graphs that is closed under taking minors has a polynomial time algorithm to determine whether it's in this class or not. For example, planar graphs can be drawn in a plane without crossing lines.
Clips
A discussion on the powerful theorem in graph theory by Robinson and Seymour; that every class of graphs that is closed under taking minors can be determined whether it's in this class or not through a polynomial time algorithm.
1:01:12 - 1:09:01 (07:48)
Summary
A discussion on the powerful theorem in graph theory by Robinson and Seymour; that every class of graphs that is closed under taking minors can be determined whether it's in this class or not through a polynomial time algorithm. The discussion mainly focuses on planar graphs and non-planar graphs and their corresponding properties.
ChapterRobinson and Seymour's Theorem and Graph Theory
EpisodeDonald Knuth: Algorithms, TeX, Life, and The Art of Computer Programming
PodcastLex Fridman Podcast
The existence of intelligent life outside of Earth is a possibility due to the vast number of planets in the universe; however, there is no way to confirm or deny the existence of extraterrestrial life.
1:09:01 - 1:10:08 (01:07)
Summary
The existence of intelligent life outside of Earth is a possibility due to the vast number of planets in the universe; however, there is no way to confirm or deny the existence of extraterrestrial life.