Last modified: 26 Feb 2018 20:00
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 

Session  Second Sub Session  Credit Points  15 credits (7.5 ECTS credits) 
Campus  None.  Sustained Study  No 
Coordinators 

* 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 inclusionexclusion * Extremal problems * The Pigeonhole Principle * Ramsey theory * Graph theory
Syllabus
Course Aims
This is the total time spent in lectures, tutorials and other class teaching.
1st Attempt: 1 twohour written examination (80%); incourse assessment (20%). Resit: 1 twohour written examination paper (maximum of (100%) resit and (80%) resit with (20%) incourse assessment).
Informal assessment of weekly homework through discussions in tutorials.
Incourse assignments will normally be marked within one week and feedback provided to students 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.