Lecturer(s)


Kobera Marek, Mgr. Bc. Ph.D.

Course content

1. Hypergraphs 2. Relations 3. Relational Objects 4. Mappings 5. Chosen Combinatorial Principles 6. Word Problems 7. Chosen Combinatorial Models 8. Word Problems 9. Graph Definition 10. Operations in Graphs 11. Walking on the Graph 12. Trees 13. Spanning Trees 14. Word Problems

Learning activities and teaching methods

Monologic (reading, lecture, briefing)

Learning outcomes

The course is targeted at the fundamental combinatorial reasoning. Basic concepts, methods and models of Discrete Mathematics are explained. Finally, the applications on word problems are practised.
Student understands the basic concepts and principles of Discrete Mathematics. On a variety of word problems, he/she demonstrates the utilization of the fundamental techniques of combinatorial calculations.

Prerequisites

none

Assessment methods and criteria

Written examination
Active attendance at seminars (100 %). Two credited tests  minimum 55% of points each. Written exam test at minimum 55% of points.

Recommended literature


Matoušek, J., Nešetřil, J. Kapitoly z diskrétní matematiky.. Praha: Karolinum, 2007.

Nýdl, V. Diskrétní matematika v příkladech, díl I.. České Budějovice: PF JU, 2006.

Rosen, K., H. Discrete Mathematics and Its Applications.. New York: McGrawHill, 1988.

Rosen, K., H. Discrete Mathematics and Its Applications.. New York: McGrawHill, 1988.

Vilenkin, N., J. Kombinatorika.. Praha: SNTL, 1977.
