Proof: An Edge is a Bridge iff it Lies on No Cycles | Graph Theory

An edge of a graph is a bridge if and only if it lies on no cycles. We prove this characterization of graph bridges in today's graph theory lesson!

My lesson on bridges:    • What are Bridges of Graphs? | Graph T...  

Proof that a walk implies a path:    • Proof: If There is a u-v Walk then th...  

Lesson on edge deletion:    • Edge Subtraction and Bridges in Graph...  

We prove the result using contrapositives. Remember the contrapositive of a statement "If P then Q" is "If not Q then not P". The contrapositive of a statement is equivalent to the original statement.



I hope you find this video helpful, and be sure to ask any questions down in the comments!

********************************************************************
The outro music is by a friend of mine named Molly Ponkevitch, who, upon my request, kindly gave me permission to use her music in my outros. I usually put my own music in the outros, but I love Molly's music, and wanted to share it with those of you watching. Please check out her wonderful music and other work, as she also does poetry and more.

Molly's YouTube:    / @mollyponkevitch1512  
Molly's Website: https://www.mollyponkevitch.com/
********************************************************************

+WRATH OF MATH+

◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

My Music Channel:    / seanemusic