PřF:M5140 Combinatorics and graph theory - Course Information

M5140 Combinatorics and graph theory

Extent and Intensity

2/1/0. 5 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)

M1110 Linear algebra I && M2100 Mathematical Analysis II && M3110 Algebra I

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

• Mathematics (programme PřF, M-MA)
• Mathematics (programme PřF, N-MA)

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í, 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

Further Comments

The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week.

Listed among pre-requisites of other courses

• FI:MA010 Graph Theory
  !PřF:M5140&&!NOW(PřF:M5140)  

• Enrolment Statistics (Autumn 2001, recent)
  
• Permalink: https://is.muni.cz/course/sci/autumn2001/M5140