Introduction
This course provides a graduate-level introduction to combinatorics.
Combinatorics studies discrete structures, often
with an emphasis on their enumeration or construction.
Combinatorial methods are ubiquitous in mathematics (and allied
disciplines). The emphasis in this course is on techniques, rather
than individual, highlighted theorems, since it is often the
combinatorial mindset which finds greatest application.
Syllabus
The first part of
the course covers enumerative techniques; subsequently, we will turn
our attention to discrete structures such as graphs. This is a
qualifying exam course, and as such has
an official syllabus.
A more detailed syllabus, indexed into the textbook, will be
available shortly.
Prerequisites
Logistics:
- Textbook The forthcoming text Combinatorial Mathematics
by Douglas
West .
- Lectures MWF, 10:00-10:50AM, ENGRG E105.
- Office hours to be announced.
Requirements and other expectations
- Homework 30% Homework will be assigned weekly, and due on
Fridays at the beginning of class. No late homework will ever be
accepted. Your work must be neat, and the pages stapled, in order
to be graded. While you are encouraged to work in groups, the
written work you hand in must be your own. On each assignment
indicate who, if anybody you consulted with.
- Midterm 30% There will be a midterm on Wednesday,
October 8 October 10
in class. No makeup exam will be given.
- Final exam 40% The final exam will be on Monday, December
10, 7:30-9:30AM. Again, no makeup exam will be given. You must pass
the exam in order to pass the course.
University expectations for class behavior in general, and academic
integrity in particular, are detailed
here.
Help
This is challenging material; it's fully expected
that sometimes you'll need a little help.
Questions directed to j.achter@colostate.edu
will be answered swiftly.
However, some questions are best answered in person. You
can come by office hours or schedule an appointment.
This page is available at http://www.math.colostate.edu/~achter/501