Syllabus
Overview of basics of computational complexity and NP-completeness. Inclusion-exclusion principle and its applications.
Generating functions. Finite projective planes, latin squares.
Hall theorem and its applications. Flows in digraphs. k-connectivity of graphs.
Ramsey theory.
Annotation
Basics of graph theory and systems of sets. Recommended for specialization Mathematical Structures within
General Mathematics and for bachelor's program in Information security.