M5B40 Combinatorics and graph theory

Faculty of Science
Autumn 2001
Extent and Intensity
2/1/0. 3 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Jiří Kaďourek, CSc. (lecturer)
Guaranteed by
doc. RNDr. Jiří Kaďourek, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: doc. RNDr. Jiří Kaďourek, CSc.
Prerequisites (in Czech)
( M1B03 || M1B10 Linear algebra I ) && ( M2B01 || MB501 Matematická analýza )
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
Elementary combinatorial coefficients.
The inclusion-exclusion principle.
The Moebius inversion formula.
Generating functions.
Solving linear recurrence formulas.
Graphs, trees.
The shortest-path problem.
The minimum-weight spanning tree problem.
Eulerian and Hamiltonian graphs.
Bipartite graphs and matchings.
Network flow problems.
Connectivity in graphs.
Planar graphs.
Literature
  • FUCHS, Eduard. Kombinatorika a teorie grafů. Vyd. 1. Praha: Státní pedagogické nakladatelství. 138 s. 1986. info
  • NEŠETŘIL, Jaroslav. Kombinatorika. Vyd. 1. Praha: Státní pedagogické nakladatelství. 173 s. 1983. URL info
Language of instruction
Czech
Further Comments
The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 1999, Autumn 2000.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/sci/autumn2001/M5B40