M5140 Combinatorics and graph theory

Faculty of Science
Autumn 1999
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.
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
Further Comments
The course is taught annually.
The course is taught: every week.
Listed among pre-requisites of other courses
The course is also listed under the following terms Autumn 2007 - for the purpose of the accreditation, Autumn 2010 - only for the accreditation, Autumn 2000, Autumn 2001, Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2011 - acreditation, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024.
  • Enrolment Statistics (Autumn 1999, recent)
  • Permalink: https://is.muni.cz/course/sci/autumn1999/M5140