Graph Theory and Applications

Math 3111: Graph Theory and Applications. Welcome Letter

Course Descriptions: A rigorous study of graph theory and algorithms. Topics include trees, connectivity, Eulerian and Hamiltonian graphs, planar graphs, graph colorings, network flows, matching theory, graph minors, and applications to large graphs. 

Course Objectives: 

• To gain a thorough understanding of the fundamental concepts of graph theory including isomorphism, trees, connectivity, higher connectivity, coloring, flows, matching theory, and planarity. 

• To understand graph algorithms such as greedy algorithms, shortest path algorithm, and algorithms for finding maximum matchings. 

• To understand and appreciate the wide variety of applications to subjects within and outside mathematics such as data science, computer science, biology, psychology, chemistry, and social and political sciences 

Prerequisites: Linear Algebra

Syllabus

Textbook: Graphs and Networks. My book blends classical graph theory with modern applications of the theory.  See the Table of Contents. The first chapter is a survey of graph theory and network science, and sets the stage for the remaining chapters. 

The book has a blog where I post stuff as time permits Graphs and Networks

HW 1