Lecturer(s)


Dobiáš Václav, Mgr. Ph.D.

Beránek Ladislav, doc. Ing. CSc.

Course content

1. Hypergraphs 2. Relations 3. Relational objects, display 4. Coloring and copying 5. Transformation in systems 6. Basic concepts of graph theory 7. Eulerian trail, Hamiltonian paths and circles 8. Travel in the graph 9. Application of travel tasks 10. Trees, spanning trees 11. The problem of the shortest path 12. Flows in the graph

Learning activities and teaching methods

Monologic (reading, lecture, briefing), Individual tutoring, Group work
 Class attendance
 52 hours per semester
 Preparation for credit
 18 hours per semester
 Preparation for exam
 30 hours per semester
 Preparation for classes
 80 hours per semester

Learning outcomes

The course is aimed at acquainting students with selected concepts, methods and models of discrete mathematics with a focus on the basics of graph theory, including examples of applications. Within the exercises, the topics are thoroughly practiced.
Students will master the basic methods and procedures of discrete mathematics, especially with a focus on graph theory. They will use this knowledge in other subjects.

Prerequisites

Basic knowledge of mathematics in the scope of the introductory course at PF.

Assessment methods and criteria

Combined exam, Interim evaluation
Active participation in seminars (100%). Passing each of the two credit tests to a minimum of 55%. Written work for the exam at least 55%.

Recommended literature


DEO, Narsingh. Graph theory with applications to engineering & computer science. Dover edition. Mineola, New York: Dover Publications, 2016.

LEWIS, Harry. Essential discrete mathematics for computer science. Princeton, NJ: Princeton University Press, 2019. ISBN 9780691179292.

MATOUŠEK, J., NEŠETŘIL, J. Kapitoly z diskrétní matematiky. V Praze: Karolinum, 2009.

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

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