A "forward backward" argument in Graph Theory. Degree sequence and connectedness.

Описание: [Undergrad, Combinatorics and Graph Theory]
In this video, we introduce the notion of degree sequence. A common question is: What are the properties of a graph that can be deduced from its degree sequence? We give one such example on connectedness, which uses an elegant "forward backward" argument.

Contents
Intro: (0:00)
Terminology: (0:20)
Examples: (0:58)
Problem: (1:55)
Proof: (2:19)

Share with me any interesting problems/topics that you would like a video on.
Facebook:   / spherical.moments  
IG:   / sphericalmoments  
Email: [email protected]

#universitymath #unimath #discretemaths #basicsofmath #combinatorics #binomialcoefficient #proof #integer #elegantproof #simpleproof #niceproof #interesting #mathproblem #puzzle #mathtips #improvemath #mistakeinmath #matholympiad #Fmath #Amath #Emath #JCmath #PigeonholePrinciple

Channel Keywords
University Math | A Level Math | O Level Math | Discrete Maths | Basics of Math | Number Theory | Combinatorics | Graph Theory | elegant Proof | simple proof | nice proof | Interesting Math Problems | Math Puzzles | Math tips | improve Math grade | common mistakes in Math | Math Olympiad | Further Maths | E Maths | A Maths | JC Math | Excel in Maths | Hard Maths problem | Hardest Maths problem | Pigeonhole Principle | Forward-backward