Abstract:
Principle of mathematical induction, pigeonhole principle, principle of inclusion and exclusion,
Permutations, variations and combinations, binomial theorem,
Genrating functions and their basic properties,
Linear recurrence relations,
Stirling, Catalan, Bell and Fibonacci sequences,
The basic properties of graphs, subgraphs, complements and graph isomorphism
Trees, forests, Prüfer code,
Euler trails and circuits, Hamilton path and cycles, Ore’s theorem, Posa’s theorem, extreme graph theory, Turán’s theorem,
Graph coloring, Brooks’ theorem, Vizing’s theorem, perfect graphs, planar graphs, dual graphs, Kuratowski’s theorem,
Mathing theory, Hall’s theorem, Könug’s theorem, Gallai’s theorem, Hungarian method, flows,
max-flow min-cut theorem
https://nik.uni-obuda.hu/targyleirasok/wp-content/uploads/2020/11/HG_NMXDM1PMNE_Dismath1_2021_1-1.pdf