SylabUZ
| Course name | Topics in Discrete Mathematics |
| Course ID | 11.1-WK-MATD-WZMD-W-S14_pNadGenEX6NW |
| Faculty | Faculty of Mathematics, Computer Science and Econometrics |
| Field of study | Mathematics |
| Education profile | academic |
| Level of studies | Second-cycle studies leading to MS degree |
| Beginning semester | winter term 2020/2021 |
| Semester | 2 |
| ECTS credits to win | 7 |
| Course type | optional |
| Teaching language | polish |
| Author of syllabus |
|
| The class form | Hours per semester (full-time) | Hours per week (full-time) | Hours per semester (part-time) | Hours per week (part-time) | Form of assignment |
| Lecture | 30 | 2 | - | - | Exam |
| Class | 30 | 2 | - | - | Credit with grade |
The course introduce the advanced notions and ideas of discrete mathematics in theoretical and algorithmic aspects.
Discrete Mathematics 1.
1. Hypergraphs, basic properties and the representation.
2. Characterization of classes of hypergraphs and their recognition algorithms.
3. Colourings of hypergraphs and the complexity of this problem.
4. The transversal and covering of hypergraphs.
5. The intersection graph and the middle graph. The algorithmic properties of these graphs and their applications.
6. New directions in hypergraph theory.
Lecture: the traditional oral essay, the participatory lecture.
Class: solving selected problems, applying the theory for solving problems.
| Outcome description | Outcome symbols | Methods of verification | The class form |
1. Verifying the level of preparation of students and their activities during the classes.
2. Two written tests.
3. The talk.
4. The written and oral exam.
Assessment criteria:
the mean of the assessment and evaluation of lectures and exams (written and oral)
The necessary condition for taking the exam is positive assessment of two tests (with tasks of different difficulty which help to assess whether students have achieved effects of the course in a minimum degree), positive assessment of the talk and active participation in the classes.
The necessary condition for passing the course is the positive assessment of the exam.
1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam 1973.
2. Branstadt, V.B Le, J.P. Spinarad, Graph Classes - A survey.
1. Recent papers on these topics.
Modified by dr Alina Szelecka (last modification: 18-09-2020 13:46)
