Discrete wiskunde (2026/2027: Periode 3)

Bekijk rooster Print deze pagina

Cursusdoel

Partially ordered sets, combinatorics, and graphs are subjects that pop up in a number of other fields within mathematics and computer science. Graphs, in particular, are prevalent in many of the sciences. Building a mathematical understanding of these subjects is a good foundation for future study.

More generally, we hope this course will help you enhance your ability to think logically, to analyze complex arguments and complex problems, as well as how to structure algorithms solving these problems. These skills are generalizable to subjects outside of mathematics and computer science, as well as careers outside of academia.

In terms of skills, we expect that students improve their ability to understand, evaluate and create proofs. Specifically, being able to use typical proof techniques for Discrete Mathematics.

The course has various learning goals; at the end of the course, students are able to:
- Comprehend and explain proofs using complex arguments on Discrete Structures.
- Choose a familiar proof strategy to apply to solve a problem on Discrete Structures.
- Formulate clear mathematical arguments.
- Create algorithms using discrete structures.
- Create proofs to show an algorithm on a discrete structure's correctness.

Assessment
Homework assignments (15%)
Midterm exam (45%)
Final exam (45%)

Vakinhoudelijk

The course follows very closely the book "Invitation to Discrete Mathematics" by Jiri Matousek and Jaroslav Nesetril.

The course covers five topics:
  • partial orders (chapter 2)
  • combinatorial counting (chapter 3)
  • graph theory (chapter 4)
  • trees (chapter 5)
  • planar graphs (chapter 6)
Course form
Lectures, tutorials, both in-person.
We will record the lectures if possible (it depends on the audiovisual equipment available on location).

Werkvormen

Hoorcollege

Werkcollege

Toetsing

Eindresultaat

Verplicht | Weging 100% | ECTS 7,5

Ingangseisen en voorkennis

Ingangseisen

Er is geen informatie over verplichte ingangseisen bekend.

Voorkennis

Er is geen informatie over benodigde voorkennis bekend.

Voertalen

  • Nederlands

Cursusmomenten

Gerelateerde studies

Tentamens

Er is geen tentamenrooster beschikbaar voor deze cursus

Verplicht materiaal

Er is geen informatie over de verplichte literatuur bekend


Aanbevolen materiaal

  • BOEK
    "Invitation to Discrete Mathematics" by Jiri Matousek and Jaroslav Nesetril. ISBN: 9780198570431

Coördinator

L. Meijer MSc l.meijer2@uu.nl

Docenten

L. Meijer MSc l.meijer2@uu.nl
dr. T. Miltzow t.miltzow@uu.nl

Inschrijving

Deze cursus is open voor bijvakkers. Controleer wel of er aanvullende ingangseisen gelden.

Inschrijving
Van maandag 2 november 2026 tot en met vrijdag 20 november 2026

Na-inschrijving
Van maandag 18 januari 2027 tot en met dinsdag 19 januari 2027

Inschrijving niet geopend
Permanente link naar de cursuspagina
Laat in de Cursus-Catalogus zien
Laat in MyTimetable zien