Last modified: 25 Mar 2016 11:35
Combinatorics is the branch of mathematics
concerned with counting. This includes counting structures of a given kind
(enumerative combinatorics), deciding when certain criteria can be met, finding
"largest", "smallest", or "optimal" objects
(extremal combinatorics and combinatorial optimization), and applying algebraic
techniques to combinatorial problems (algebraic combinatorics). The course is
recommended to students of mathematics and computing science.
| Study Type | Undergraduate | Level | 1 |
|---|---|---|---|
| Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
| Campus | None. | Sustained Study | No |
| Co-ordinators |
|
||
* Induction * Growth rates * Subsets and binomial coefficients (subsets of fixed size, properties of binomial coefficients, the binomial therem) * Partitions and Bell numbers * Counting with symmetry * Recurrences * Generating functions * Derangements * Principle of inclusion-exclusion * Extremal problems * The Pigeonhole Principle * Ramsey theory * Graph theory
Information on contact teaching time is available from the course guide.
1st Attempt: 1 two-hour written examination (80%); in-course assessment (20%). Resit: 1 two-hour written examination paper (maximum of (100%) resit and (80%) resit with (20%) in-course assessment).
Informal assessment of weekly homework through discussions in tutorials.
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.
