Syllabus
Generating functions and combinatorial enumeration.
Extremal graph theory.
Ramsey theory.
Network flows and graph connectivity measures.
Structural aspects of set systems and transversals.
Embedding of graphs to surfaces of higher genus and their chromatic numbers.
Regular combinatorial structures, existence.
Finite projective planes.
Balanced incomplete block designs.
Steiner triple systems.
Symmetric designs, Bruck-Ryser-Chowla theorem.
Hadamard matrices.
Mutually ortogonal Latin squares.
Annotation
Basic topics of graph theory and regular combinatorial structures.