| CODE | MAT3411 | ||||||||
| TITLE | Combinatorics | ||||||||
| UM LEVEL | 03 - Years 2, 3, 4 in Modular Undergraduate Course | ||||||||
| MQF LEVEL | 6 | ||||||||
| ECTS CREDITS | 5 | ||||||||
| DEPARTMENT | Mathematics | ||||||||
| DESCRIPTION | - The cycle index of a permutation group and the use of Polya’s theorem; - Ramsey’s theorem for graphs; - Introduction to error-correcting codes; - Introduction to combinatorial designs. Main Texts - Gross J.L. and Yellen J., Handbook of Graph Theory, CRC Press, 2nd Edition, 2004. - Wilson R.J., Introduction to Graph Theory, Longman, 4th Edition, 1996. - West D.B., Introduction to Graph Theory, Prentice Hall, 2nd Edition, 2001. - Biggs N.L., Discrete Mathematics, Oxford Science Publications, Clarendon Press, 1989. - Agnarsson G. and Greenlaw R., Graph Theory: Modelling, Applications and Algorithms, Pearson, 2006. Supplementary Reading - Diestel R., Graph Theory, Springer-Verlag, 3rd Edition, 2006. - Cameron P.J., Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1994. - Bryant V., Aspects of Combinatorics: A Wide Ranging Introduction, Cambridge University Press, Cambridge, 1993. |
||||||||
| ADDITIONAL NOTES | Follows from: MAT1411 Leads to: MAT5413 |
||||||||
| STUDY-UNIT TYPE | Lecture | ||||||||
| METHOD OF ASSESSMENT |
|
||||||||
| LECTURER/S | Peter Borg |
||||||||
|
The University makes every effort to ensure that the published Courses Plans, Programmes of Study and Study-Unit information are complete and up-to-date at the time of publication. The University reserves the right to make changes in case errors are detected after publication.
The availability of optional units may be subject to timetabling constraints. Units not attracting a sufficient number of registrations may be withdrawn without notice. It should be noted that all the information in the description above applies to study-units available during the academic year 2024/5. It may be subject to change in subsequent years. |
|||||||||