Eulerian Trails and Graph Theory - How Impossible is the Drawing Challenge?
Wrath of Math via YouTube
Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
Google, IBM & Meta Certificates — 40% Off for a Limited Time
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a popular internet drawing challenge through the lens of graph theory in this 19-minute mathematical video. Discover why certain drawing puzzles that go viral online are actually impossible to complete, connecting them to the mathematical concept of Eulerian trails. Learn about Eulerian circuits and trails while examining a specific theorem that quantifies exactly how impossible these challenges are on any connected graph. Delve into the mathematical principles behind these seemingly simple drawing problems, understanding the role of vertices, edges, and graph connectivity. The presentation draws from Douglas B. West's "Introduction to Graph Theory" and demonstrates how mathematical concepts like the pigeonhole principle apply to these viral challenges. Gain insight into why mathematicians immediately recognize these drawing puzzles as graph theory problems and understand the mathematical reasoning that determines their solvability.
Syllabus
0:00 The Challenge
5:08 They're Called Graphs
5:52 Mathshion
6:28 Euler
7:50 How Impossible is It?
11:00 Theorem
18:04 Conclusion
Taught by
Wrath of Math