Syllabus
Basic notions, binary relations, equivalences and partially ordered sets.
Functions and their properties, permutations.
Combinatorial counting, Binomial theorem.
Principle of inclusion and exclusion and its applications.
Discrete probability.
Graphs - notions and examples. Paths and circuits in graphs, connectivity.
Trees, spanning trees of graphs.
Planar graphs, Euler's formula, max. number of edges.
Graph colorings, d-degenerate graphs. Five color theorem for planar graphs.
Eulerian graphs.
Higher connectivity, Menger's and Ford-Fulkerson's theorems.
Annotation
An introductionary course on combinatorics and graph theory for students of bioinfomatics.