|
Lecturer(s)
|
-
Eisner Jan, Mgr. Dr.
-
Zahradníková Michaela, RNDr. Ph.D.
|
|
Course content
|
Content of lectures: Combinatorics: sets, functions, permutations and factorial; binomial coeficients and Pascal triangle, Binomial and Multinomial theorem; principle of inclusion and exclusion ant its applications. Relations: equivalence and ordening. Graphs: definition and representations of graphs, degree sequence; connectivity, trees and spanning trees; planar graphs. Content of practicals: Application of theoretical principles.
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming)
- Preparation for exam
- 28 hours per semester
- Class attendance
- 28 hours per semester
- Preparation for classes
- 28 hours per semester
|
|
Learning outcomes
|
Introduction to basics of combinatorics and graph theory.
The student will acquire the basic knowledge of elements- of combinatorics, relations and graph theory.
|
|
Prerequisites
|
The knowledge of mathematics on the level of secondary level education, in particular the basics of combinatorics.
|
|
Assessment methods and criteria
|
Oral examination, Combined exam, Test
Active participation on practicals, successful writing of a homework (70%) and of a written exam test (50%).
|
|
Recommended literature
|
-
J.Matoušek, J.Nešetřil. Kapitoly z diskrétní matematiky. MatfyzPress, Praha 1996..
-
L.Lovász, J.Pelikán, K.Vesztergombi. Discrete Mathematics - Elemantary and Beyond. Springer, 2003.
|