Proof: Graph has a Cycle Longer than its Minimum Degree | Graph Theory

If G is a graph with minimum degree delta, with delta greater than or equal to 2, then G contains a cycle of length at least delta+1. In other words, a graph with minimum degree at least 2 must have a cycle whose length is greater than its minimum degree!

What is the degree of a graph:    • What are Adjacent Vertices? | Graph T...  
Here is a similar proof regarding paths:    • Proof: Every Graph Contains Minimum D...  

Thanks to Nasser Alhouti, Robert Rennie, Barbara Sharrock, and Lyndon for their generous support on Patreon!

◆ Donate on PayPal: https://www.paypal.me/wrathofmath
◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

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

+WRATH OF MATH+

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

My Music Channel:    / @emery3050