Course: Combinatorial Methods

» List of faculties » FP » KAP
Course title Combinatorial Methods
Course code KAP/KOM
Organizational form of instruction Lecture + Lesson
Level of course Master
Year of study not specified
Semester Summer
Number of ECTS credits 6
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements Course does not contain work placement
Recommended optional programme components None
Course availability The course is available to visiting students
Lecturer(s)
  • Koucký Miroslav, doc. RNDr. CSc.
  • Jirsák Čeněk, Mgr.
Course content
unspecified

Learning activities and teaching methods
Monological explanation (lecture, presentation,briefing)
  • Class attendance - 56 hours per semester
  • Preparation for exam - 90 hours per semester
Learning outcomes
Students will learn selected combinatorial methods (generating functions, partitions, recurrence relations, selected parts of the 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
  • AIGNER, Martin. Combinatorial Theory. Berlin: Springer, 1997. ISBN 3-540-61787-6.
  • J. Matoušek, J. Nešetřil. Kapitoly z diskrétní matematiky. Karolinum, 2009. ISBN 80-246-0084-.
  • Rosen K. Discrete mathematics and its applications. McGraw-Hill, 1999.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester