|
Lecturer(s)
|
-
Dofková Radka, doc. PhDr. Ph.D.
-
Laitochová Jitka, doc. RNDr. CSc.
-
Pastor Karel, doc. Mgr. Ph.D.
|
|
Course content
|
Essential terms will be defined in illustrations, and the most signifiant results of the graph theory and combinatorics will be worded. Most attention will be paid to applying the graph theory (e.g. drawing pictures with a single stroke, finding a way through a labyrinth, postman?s problem, finding the shortest way).
|
|
Learning activities and teaching methods
|
|
Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Graph theory: basic notions, important theoretical achievements. Applying the graph theory to everyday mathematics and everyday situations. Combinatorics: basic combinatoric functions. Variation, permutation, combination. Equivalence relations. Inclusion and exclusion. Iterative formulas.
Students will deepen their basic knowledge of combinatorics and acquire basic knowledge of graph theory. They know the typical problems that are solved in this discipline.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written exam, Seminar Work
Active participation in seminars, elaboration, presentation and submitting a seminar thesis.
|
|
Recommended literature
|
-
HANZEL, P.: Grafy a ich elevácie. Banská Bystrica, UMB, 2005, ISBN 80-8083-120-3..
-
Sedláček, J.: Úvod do teorie grafů, Academie, Praha, 1981..
-
ZNÁM, Š.: Kombinatorika a teória grafov, skriptum, Bratislava, PrF UK, 1978..
|