Mathematics BSc
Course description
2013.
Course description
2013.
Discrete mathematics 1
Hours lect+pc |
Credits lect+pc |
Assessment | Specialization | Course code lect/pc |
Semester | Status |
---|---|---|---|---|---|---|
2 + 2 | 2 + 3 | exam + term grade |
all | mm1c1vm1 mm1c2vm1 |
1 | compulsory |
Course coordinator
Strong | Weak | Prerequisites | |
---|---|---|---|
Lecture | |||
Weak:
practice class
|
Prerequisites
High school mathematics.
Literature
- L. Lovász, J. Pelikán, K. Vesztergombi: Discrete mathematics. Elementary and beyond. Springer, 2003.
Syllabus
- Basic enumerative combinatorics. Permutation, variation, combination. The exclusion-inclusion principle. The pigeon hole principle. Binomial coefficients.
- Graphs. Degree, connectivity, subgraphs. Trees, Prüfer-code, Cayley theorem. Graph coloring. Bipartite graphs. Eulerian trails and circuits. Hamiltonian paths and circuits. Planar graphs. 6-, 5- and 4-color theorem.