Math 3012 - Applied Combinatorics

Lecture Notes

1. Chapter 1:  An Overview of Combinatorics

2. Chapter 2:  Number Systems and Relations 

3. Chapter 3:  Strings, Sets and Binomial Coefficients 

4. Chapter 4:  Partially Ordered Sets 

5. Chapter 5:  Graphs - Basic Concepts 

6. Chapter 6:  Graph Algorithms

7. Chapter 7:  Recurrence Equations 

8. Chapter 8:  Inclusion-Exclusion

9. Chapter 9:  Ramsey Theory   

10. Chapter 10:  Enumerating Spanning Trees 

11. Chapter 11:  Generating Functions

12. Chapter 12:  Network Flows

13. Chapter 13:  Two Combinatorial Applications of Network Flows

14. Appendix:  Elementary Set Theory

Presentations  

1. Partially Ordered Sets

2. Graphs - Basic Concepts

3. Eulerian Circuits 

4. Spanning Tree Algorithms 

5. Dijkstra's Algorithm - Shortest Paths 

Programs

1. sequence.c

2. sum_recursive.c

3. sum_loop.c

4. big_integer_addition.c 

5. naivegcdlcm.c

6. gcdlcm.c

7. integer.c

8. generate_file.c

9. mergesort.c         mergesort.h    Feb 18

10. is_a_poset.c       poset.h    Expanded - Feb 18

11. generate_poset.c

12. antichain_partition.c 

13. interval_order.c      Feb 18

14. generate_intorder.c   New - Feb 19

Files

1. mydata.txt

2. brfoo1.txt

3. brfoo2.txt

4. brfoo3.txt

5. intorderdata.txt    New!!