New Video Series on Graph Theory

This series describes some basic theories in graph theory. We go over some basic definitions in graph theory, what isomorphisms are and what being connected means, eulerian, hamiltonian, Cayley and planar graphs, tournaments and Ramsey numbers. We prove some basic theorems for these various different types of graphs, and prove the existence of the Ramsey number for complete graphs. We give a necessary and sufficient condition for a graph to be eulerian, a sufficient condition to be hamiltonian, and a necessary condition fo a planar graph.