Graph Theory
where Combinatorics happens
4.75 (2 reviews)
44
students
10.5 hours
content
Jun 2020
last update
$44.99
regular price
What you will learn
Definitions in graph theory
Foundations of graph theory
Combinatorics
Description
Graphs are very simple mathematical objects that can model basically every problem in combinatorics, and as such one can rapidly go from what is well known to what is unknown with just a few more definitions. Discover with me the beauty of this topic.
This is part of the syllabus for maths olympians in high school. Also discrete maths in undergraduate university.
Content
Introduction
Introduction
Schedule
Basics of Graph theory (easy version)
PST Ch14
14.1 Handshaking Lemma
14.3 Trees
14.4 Bipartite graphs
14.6 Euler Trails
14.10 Planar graphs
Basics of Graph theory (more rigorous version)
GTM Ch1
Existence of Euler circuits and trails
Vertex set connected to a vertex
No odd cycles in Bipartite graphs
Exercise 1
Exercise 2
Travelling Salesman problem
Exercise 3
Hamiltonian cycles for complete graphs
Kuratowski's Theorem stated
Planar graph sizes from girths proof
Take home exam
Problems GTM1
GTM1 Ex 5 live 1 on 1
GTM1 Ex 6 and 7 live 1 on 1
Charts
Price
Rating
Enrollment distribution
Related Topics
3171130
udemy ID
5/26/2020
course created date
6/24/2020
course indexed date
Bot
course submited by