Math 3050

Slides

· Introduction

· Proof techniques

· Sequences

· Magic tables

· Induction

· Strong Induction (optional)

· Recursion

·  Counting1

·  Counting2

·  Counting3

·  Counting4

·  Counting5

 ·  Graphs1

·  Graph Applications

·  Graphs1appendix (optional)

·  Graphs2

·  Graphs2 more examples (optional)

·  Trees

·   Graph coloring

·  Extra material on graph coloring

·  Discrete Optimization

· Efficiency of algorithms 1

·  Efficiency of algorithms 2

·  Maximum flow problem

·  Minimum cut problem

·  Extra material on Max Flow and Min Cut problems

 ·  Extra example on Max Flow and Min Cut (solution in class)

·  Applications of Max Flow (optional)

·  Baseball Elimination Problem

·  Practice problem on Baseball Elimination Problem

·  Integer programming (optional)

·  Integer programming model for solving the coloring problem (optional)