Mantel's Theorem: Extremal Graph Theory Primer, and Intro To Turan's Theorem

In this video we discuss the problem of finding a tight upper bound on the number of edges a graph on n vertices can have if it is also known that the graph has no 3-cycle in it. This is known as Mantel's Theorem and it is a special case of Turan's Theorem which generalizes this problem from a 3-cycle (a complete graph on 3 vertices) to complete graphs on arbitrary numbers of vertices.

#TuranGraph #MantelsTheorem #GraphTheory

CHECK OUT OTHER TYPES OF VIDEOS:

================================

GRE Math Subject Test:    • Improve Your Math Subject GRE Score  

Putnam Math Competition:    • Putnam Math Competition | Improve Your Put...  

Math Theorem Corner:    • Math Theorems | Learn New Math Theorems  

Math Problems Corner:    • Problem Solving Strategies  

Math Insights:    • Learn New Math Techniques!  

Academic Advice:    • Academic Advice for Undergrads  


GET MY BOOK ON AMAZON!!
========================

"Number Theory Towards RSA Cryptography in 10 Undergraduate Lectures"

https://www.amazon.com/Number-Theory-...

CHECK ME OUT ON THE INTERNET!!
==============================

Website: www.mohamedomar.org
Twitter: @ProfOmarMath
Instagram: profomarmath
YouTube:    / profomarmath  

And of course, subscribe to my channel!