1. komponenta

Lecture type	Total
Lectures	30
Exercises	30

COURSE AIMS AND OBJECTIVES: It serves as an introduction to basic combinatorics, discrete mathematics and graph teory.

COURSE DESCRIPTION AND SYLLABUS:
1. Combinatorial enumeration. Enumeration of sets, functions, injections, bijections. Binomial formula and binomial coefficients.
2. Some recursive problems. Fibonacci numbers, Catalan numbers, Linear reccurences.
3. Inclusion-exclusion principle. Principle and applications.
4. Generating functions. Basic ideas, examples and applications.
5. Introduction to graphs. Paths, cycles, trees, walk on graphs. Graph colorings. Planar graphs. Matchings in graphs.

1. Predavanja iz Diskretne matematike, I. Nakić.
2. Combinatorics: Topics, Techniques, Algorithms, P. J. Cameron, Cambridge University Press, 1994.
3. A first Course in Discrete Mathematics, I. Anderson, Springer Verlag, 2001.
4. Discrete Mathematics, L.Lovasz, J.Pelikan, K.L.Vesztergombi, Springer Verlag, 2003.
5. Vježbe iz Diskretne matematike. Dvostruko prebrojavanje, B. Bašić, M. Marohnić i dr..
6. Principles and Techniques in Combinatorics, C.Chuan-Chong, K. Khee-Meng, World Scientific Publishing Company, Singapore, 1992.
7. Kombinatorika, M.Cvitković, Element, Zagreb, 1994.

Enrollment :
Passed : Elementary mathematics 1
Passed : Mathematical analysis 1

Mandatory course - Regular study - Mathematics