M010 Combinatorics and Graph Theory

Faculty of Informatics
Autumn 1996
Extent and Intensity
2/0. 2 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. RNDr. Jiří Kaďourek, CSc. (lecturer)
Guaranteed by
Contact Person: doc. RNDr. Jiří Kaďourek, CSc.
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
Syllabus
  • 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.
Language of instruction
Czech
The course is also listed under the following terms Autumn 1995, Autumn 1997, Autumn 1998, Autumn 1999, Autumn 2000, Autumn 2001.
  • Enrolment Statistics (Autumn 1996, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1996/M010