Math 3012:  Applied Combinatorics

Tu - Th 9:35 - 9:55am
Skiles 246
Spring 2007

Professor William T. Trotter

• Contact Information

Course Syllabus

• Syllabus, Course Outline and Grading Policy

Lecture Notes

• Chapter 1:  An Overview of Combinatorics
• Chapter 2:  Strings, Sets and Binomial Coefficients
• Chapter 3:  Induction and Recursion
• Chapter 4:  Partially Ordered Sets
• Chapter 5:  Basic Concepts of Graph Theory
• Chapter 6:  Inclusion/Exclusion
• Chapter 7:  Generating Functions
• Chapter 8:  Recurrence Equations
• Chapter 9:  Ramsey Theory
• Chapter 10:  Graph Algorithms
• Chapter 11:  Network Flows
• Chapter 12:  Applications of Network Flows
• Appendix A:  Set Theory for Combinatorics
• Appendix B:  Number Systems and Relations

Presentations

• Spanning Tree Algorithms
• Dijkstra's Algorithm

Computer Programs, Header Files and Data Files

• sum_recursive.c
• sum_loop.c
• collatz_sequence.c
• gcd_lcm.c
• combinatorics.h
• mergesort.c    random_ints.txt
• big_integer_addition.c    two_big_integers.txt

Solutions for Tests

• Test 1: Thursday, February 8
• Test 2: Thursday, March 8
• Test 3: Thursday, April 19

Updated August 19, 2007.