|
Lecturer(s)
|
-
Jirsák Čeněk, Mgr.
-
Koucký Miroslav, doc. RNDr. CSc.
|
|
Course content
|
Combinatorics - basic counting techniques (rules of sum, product, principle of inclusion-exclusion pigeonhole principle), permutations and combinations (without and with repetitions), extended binomial coefficient, multinomial coefficient, partitions of integer (Stirling, Bell numbers). Graph theory - basic notions, representations (adjacency and incidence matrix) Euler's theorem, Havel's theorem, graph operations, special classes of graphs, distance, connectivity, Eulerian graphs, planar graphs, spanning tree.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 42 hours per semester
- Preparation for credit
- 80 hours per semester
|
|
Learning outcomes
|
The subject covers solving linear recurrence relations, combinatorics and graph theory.
Theoretical knowledge and ability to apply them.
|
|
Prerequisites
|
Knowledge of the secondary level mathematics
|
|
Assessment methods and criteria
|
Combined examination
Active participation in seminars, credit, knowledge accordant with syllabus.
|
|
Recommended literature
|
-
Koucký M. Diskrétní matematika II. Skriptum TUL, Liberec, 2003.
-
Koucký M. Sbírka příkladů z diskrétní matematiky. Skripta TUL, Liberec, 2003.
-
Koucký M., Zelinka B. Diskrétní matematika I. Skriptum TUL, Liberec, 2003.
|