This course is not currently conducted!
Erasmus code: 11.1
ISCED code: 0541
ECTS credits:
unknown
Language:
Polish
Organized by:
Faculty of Mathematics, Informatics, and Mechanics
Discrete Mathematics I 1000-211aMD1
Methods of combinatorics and graph theory with computer science flavour.
1. recurrences
2. finite sums
3. binomial coefficients
4. permutations, Stirling numbers
5. generating functions
6. enumerators, permutations with restrictions
7. graphs: Euler and Hamilton cycles, planarity, colorings, trees
8. Hall theorem, systems of distinct representatives
Type of course
obligatory courses
Bibliography
1. Graham, Knuth, Patashnik, "Concrete Mathematics"
2. Lipski, "Kombinatoryka dla programistów"
3. Palka, Ruciński, "Wykłady z kombinatoryki"
4. Wilson, "Introduction to graph theory"
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: