Mathematics BSc
Course description
2013.
Course description
2013.
Discrete mathematics 2
Hours lect+pc |
Credits lect+pc |
Assessment | Specialization | Course code lect/pc |
Semester | Status |
---|---|---|---|---|---|---|
2 + 2 | 2 + 3 | exam + term grade |
all | mm1c1vm2 mm1c2vm2 |
2 | compulsory |
Course coordinator
Strong | Weak | Prerequisites | |
---|---|---|---|
Practice class | |||
Strong:
Discrete mathematics1L
(mm1c1vm1)
| |||
Lecture | |||
Weak:
practice class
|
Literature
- L. Lovász, J. Pelikán, K. Vesztergombi: Discrete mathematics. Elementary and beyond. Springer, 2003.
Syllabus
- Graph matching. The König-Hall theorem. Graph parameters, Gallai's theorems.
- Linear recursion, the characteristic equation. Catalan numbers.
- Ramsey-theory. Sperner theorem, LYM inequality, De Bruijn-Erdős theorem. C4-free graphs. Finite projective planes over the "mod p" field.