MATH3510
Combinatorics and Graph Theory
10 Units
Available in 2014
| Callaghan Campus | Semester 1 |
|---|
Previously offered in 2013, 2012, 2011, 2010, 2009, 2008, 2006, 2004
Combinatorics and Graph Theory is a blend of the mathematical techniques applicable to Computer Science, Information Technology and Statistics. This is 'discrete' mathematics as distinct from the continuous mathematics of calculus. It is a major growth area in modern mathematics, largely because of emerging applications in areas such as biotechnology and communication security.
Much of the subject matter is a continuation of topics studied in MATH1510 such as graphs, trees, and enumeration, and additional topics such as experimental design and finite geometry are introduced. Some use is made of basic techniques from calculus and abstract algebra.
| Objectives | On successful completion of this course, students will have: 1. an in-depth knowledge of one specific area of mathematics. 2. an improved ability to communicate mathematical ideas. 3. some experience with applications of mathematics to the Information Sciences. |
||||||
|---|---|---|---|---|---|---|---|
| Content | * Enumeration: generating functions, recurrence relations, Polya's Theorem, inclusion-exclusion. * Graph theory: paths and cycles, connectivity, factorisations, colouring, planarity applications. * Combinatorial Designs: finite fields, Latin squares, Steiner triple systems, finite geometries. |
||||||
| Replacing Course(s) | n/a | ||||||
| Transition | n/a | ||||||
| Industrial Experience | 0 | ||||||
| Assumed Knowledge | MATH1510 | ||||||
| Modes of Delivery | Internal Mode | ||||||
| Teaching Methods | Lecture | ||||||
| Assessment Items |
|
||||||
| Contact Hours | Lecture: for 3 hour(s) per Week for Full Term | ||||||
| Timetables | 2014 Course Timetables for MATH3510 |