MATH-260(a) / coefficient 4

Teacher: Viazovska Maryna

Language: English


Study of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis will be laid on structures that the students will see again in their later studies.


  1. Elementary Combinatorics, counting.
  2. Graphs, Trees.
  3. Partially ordered sets, Set systems.
  4. Generating functions.
  5. Probabilistic method.
  6. Linear Algebra method.


Combinatorics, graphs, set systems

Learning Prerequisites

Required courses

Linear algebra, Analysis

Learning Outcomes

By the end of the course, the student must be able to:

  • Analyze discrete structures
  • Formulate main theorems of the course
  • Solve typical combinatorial problems
  • Prove main results of the course

Transversal skills

  • Use a work methodology appropriate to the task.

Teaching methods

Ex cathedra lecture with exercises in the classroom.

Expected student activities

Solving homework problems

Assessment methods

Weekly graded homeworks count as 40% of the final grade

Written exam counts as 60% of the final grade.



Discrete Mathematics: Elementary and Beyond (L. Lovasz, J. Pelikan, K. Vesztergombi), Combinatorics: Set Systems etc. (B. Bollobas), Invitation to Discrete Mathematics (J. Matousek, J. Nesetril).

Ressources en bibliothèque

Moodle Link

In the programs

  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Discrete mathematics
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Type: mandatory

Reference week

Related courses

Results from