M010 Combinatorics and Graph Theory

Faculty of Informatics
Autumn 1999
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). 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
prof. RNDr. Jan Slovák, DrSc.
Departments – Faculty of Science
Contact Person: doc. RNDr. Jiří Kaďourek, CSc.
Prerequisites
It is recommended to pass in advance the subjects M001 Calculus II, M003 Linear Algebra and Geometry I and M008 Algebra I, possibly also to enrol simultaneously for the subject M002 Calculus III.
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.
Literature
  • FUCHS, Eduard. Kombinatorika a teorie grafů. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1986, 138 s. info
  • NEŠETŘIL, Jaroslav. Kombinatorika. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1983, 173 s. URL info
Language of instruction
Czech
Follow-Up Courses
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 1995, Autumn 1996, Autumn 1997, Autumn 1998, Autumn 2000, Autumn 2001.
  • Enrolment Statistics (Autumn 1999, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1999/M010