Coursebooks 2018-2019

PDF
 

Discrete mathematics

MATH-260

Lecturer(s) :

Pach János

Language:

English

Summary

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.

Content

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

Keywords

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:

Transversal skills

Teaching methods

Ex cathedra lecture with exercises in the classroom.

Expected student activities

Solving homework problems

Assessment methods

Written exam.

Supervision

Office hours Yes
Assistants Yes

Resources

Bibliography

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
Websites

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10   CM1105 
10-11    
11-12   CM1105 
12-13    
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German