Studies
Admissions
The Institute
Resources
Studies
Admissions
The Institute
Resources
Studies
Admissions
The Institute
Resources

Math103

Combinatorics & Graphs

Barcelona Campus
Oct 20, 2025 - Nov 07, 2025
The main goal of the course is to establish a solid understanding of the basic principles of Combinatorics and Graphs valid for further broadening and specialization for applications.
Barcelona Campus
Oct 20, 2025 - Nov 07, 2025
Anier Velasco Sotomayor

Faculty

Anier Velasco Sotomayor

Lead at the ML Theory group at Cohere for AI Open Science community.

Course length

3 weeks

Duration

3 hours
per day

Total hours

45 hours

Credits

4 ECTS

Language

English

Course type

Offline

Fee for single course

€1500

Fee for degree students

€750

Skills you’ll learn

Modeling Discrete ProblemsEnumerative CombinatoricsBasic Combinatorial Graph theory
OverviewCourse outlineCourse materialsPrerequisitesMethod & grading

Overview

In this course we cover various combinatorial structures (such as permutations, combinations, graphs, trees, and partitions) and their properties. The main topic is combinatorics, expanding on fundamental concepts of enumerative combinatorics, while the secondary topic is an introduction to graph theory, exploring several properties, special types of graphs, and classical problems.

Learning highlights

  • The goal of the course is to introduce various counting methods and to study combinatorial structures, with a particular focus on providing a comprehensive introduction to graph theory.
  • By the end of the course, students should be prepared to study algorithms and data structures in computer science, as well as probability in the continuation of the mathematics programme.

Course outline

15 classes

Dive into the details of the course and get a sense of what each class will cover.
Monday
Tuesday
Wednesday
Thursday
Friday
Monday
1

Session 1

Set Theory refresh.

Tuesday
2

Session 2

Proofs recap.

Wednesday
3

Session 3

Intro to enumerative, existential and constructive combinatorics.

Thursday
4

Session 4

Modeling. Basic counting: Sum and Product rule.

Friday
5

Session 5

Weekly exam 1. More Modeling. Double counting. Invariants.

Monday
6

Session 6

Binomial and Multinomial coefficients. Permutations and Combinations.

Tuesday
7

Session 7

Inclusion-Exclusion.

Wednesday
8

Session 8

Recurrent equations. Power series.

Thursday
9

Session 9

Intro to Generating Functions.

Friday
10

Session 10

Weekly exam 2.

Monday
11

Session 11

Discrete Probabilities I.

Tuesday
12

Session 12

Discrete Probabilities II.

Wednesday
13

Session 13

Intro to Graph Theory I.

Thursday
14

Session 14

Intro to Graph Theory II.

Friday
15

Session 15

Final Exam.

Prerequisites

A certain level of mathematical maturity (including an understanding of proofs and standard high-school algebra).

Additionally, although it is not a strong requirement, it is recommended to possess:

basic python programming skills (loops, functions, recursion, lists)

basic skills with power series

basic linear algebra

Methodology

The classes will be a combination of lectures, covering fundamental theory, and problem-solving sessions, where previously introduced concepts will be applied. Occasionally, there will be programming demonstrations to illustrate certain results. Different techniques will be introduced through motivating problems and then generalised.

Students are expected to study the material at home after each lecture, using the recommended bibliography and the teacher’s notes. The exam tasks will not be mere reproductions of those covered in class; therefore, students should not focus solely on memorising content.

For advanced students, additional topics may be provided (e.g., Pólya’s theory, Ramsey theory), which can be discussed outside class.

The course prioritises rigour and clarity when formulating and proving statements. While extreme formality is not required, a certain level of precision will be expected.

Grading

The final grade will be composed of the following criteria:
10% - In-class participation
30% - Homework
30% - Weekly Exams
30% - Final Exam
Anier Velasco Sotomayor

Faculty

Anier Velasco Sotomayor

Lead at the ML Theory group at Cohere for AI Open Science community.

Anier started in computer science by doing programming Olympiads in high school, during which he obtained a gold medal in the Cuban National Olympiad and a bronze medal in the Ibero-American Olympiad in Informatics.

He has a BSc. in Computer Science and Data Science from Harbour.Space University. His main professional interest is Machine Learning Theory Research, and he’s an independent researcher.

See full profile

Apply for this course

Snap up your chance to enroll before all spaces fill up.

Combinatorics & Graphs

by Anier Velasco Sotomayor

Total hours

45 Hours

Dates

Oct 20 - Nov 07, 2025

Fee for single course

€1500

Fee for degree students

€750

How to secure your spot

Complete the form below to kickstart your application

Schedule your Harbour.Space interview

If successful, get ready to join us on campus

FAQ

Will I receive a certificate after completion?

Yes. Upon completion of the course, you will receive a certificate signed by the director of the program your course belonged to.

Do I need a visa?

This depends on your case. Please check with the Spanish or Thai consulate in your country of residence about visa requirements. We will do our part to provide you with the necessary documents, such as the Certificate of Enrollment.

Can I get a discount?

Yes. The easiest way to enroll in a course at a discounted price is to register for multiple courses. Registering for multiple courses will reduce the cost per individual course. Please ask the Admissions Office for more information about the other kinds of discounts we offer and what you can do to receive one.