M301 Introduction to Combinatorial Theory, Fall 2006
- Lectures Monday, Wednesday and Friday 3:10-4:00 pm in ENGRG E205
Office hours: Monday 4-5pm, Wednesday 8-9am.
phone 491 1865, email betten at math dot colostate dot edu
Combinatorial Algorithms, Generation, Enumeration and Search by Donald L. Kreher and Douglas R. Stinson, CRC Press Boca Raton, 1999.
Homework and Quizzes
Homework will be assigned but not collected. Quizzes will be held
Friday every second week to review the material from the previous two weeks.
There will be three midterms and one final exam.
These will be held in the lecture room.
There will be no make-up exams. If you have a conflict, you need to
discuss the matter with the teacher well in advance.
- Midterm 1: September 25
Midterm 2: October 23
Midterm 3: November 15
Final: during final's week December 11-15, the exact
date can be found at the registrar's website.
It will not be published here.
Your final grade will be determined from a score of 600.
The quizzes and midterms count 100 points each,
the final counts 200 points.
The following is a rough outline. The order in which we proceed may vary
from the order in the list.
In addition, we will discuss and implement algorithms in Maple.
- Introduction and basic techniques.
Induction and recurrence,
sets and subsets,
permutations and combinations,
partitions and compositions,
Pascal's triangle and combinatorial identities.
Generating functions, characteristic roots. Moebius function.
Fibonacci numbers. Partition numbers. Catalan numbers.
Relations and orders,
posets and lattices,
the lexicographic ordering, the order tree.
Ranking and unranking vs. first and next.
Dijkstra's algorithm to generate all permutations.
Generating all subsets. Generating all partitions.
Graphs, subgraphs, isomorphism, trees and bipartite graphs, Pruefer code, connectedness,
Euler and Hamiltonian, cliques.
Graph algorithms, depth first search, breadth first search.
Digraphs and networks, minimum spanning trees (Kruskal vs. Prim),
shortest paths (Dijkstra), max-flow-min-cut, augmenting paths (Ford and Fulkerson).
Matchings, systems of distinct representatives (Hall). Inclusion and exclusion.
Backtrack search, generating all cliques,
estimating the size of a search tree,
the traveling salesman.
Heuristic search, local search, "Bridge" scheduling techniques, "Domino-portraits", other applications.
Groups and symmetry, Cauchy-Frobenius (a.k.a. Burnside's Lemma),
Polya counting, cycle enumerators.
Isomorphism and certificates. Equitable graph partitions.
Some special classes of graphs:
strongly regular graphs, distance regular graphs,
incidence graphs, Paley graphs, the Clebsch graph, Cayley-graphs, Rubik's cube graph,
We are going to use the computer lab in Weber 205,
here are some general rules by the system administrator zube:
There is a similar course on Graph Theory and Combinatorics taught at the University of Wellington, Victoria, New-Zealand.
It has lecture notes which are helpful. The link is:
A similar course on Graph Theory and Combinatorics
A web site containing a classification of small graphs with given regularity and girth
File translated from
On 14 Nov 2006, 14:44.