Duration:
1 Semester | Turnus of offer:
every second year | Credit points:
4 |
Course of studies, specific field and terms: - Master MES 2020 (optional subject), mathematics / natural sciences, Arbitrary semester
- Bachelor Robotics and Autonomous Systems 2020 (optional subject), mathematics, 5th or 6th semester
- Bachelor Medical Informatics 2019 (optional subject), mathematics, 4th to 6th semester
- Bachelor IT-Security 2016 (optional subject), mathematics, Arbitrary semester
- Bachelor Robotics and Autonomous Systems 2016 (optional subject), mathematics, 5th or 6th semester
- Bachelor Medical Informatics 2014 (optional subject), mathematics, 5th or 6th semester
- Master MES 2014 (optional subject), mathematics / natural sciences, 1st or 2nd semester
- Bachelor Computer Science 2014 (optional subject), central topics of computer science, 5th or 6th semester
- Master CLS 2010 (optional subject), mathematics, Arbitrary semester
- Master MES 2011 (optional subject), mathematics, 1st or 2nd semester
- Bachelor CLS 2010 (optional subject), mathematics, 5th or 6th semester
- Bachelor Computer Science 2012 (optional subject), mathematics, 5th or 6th semester
|
Classes and lectures: - Graph theory (exercise, 1 SWS)
- Graph theory (lecture, 2 SWS)
| Workload: - 20 Hours exam preparation
- 55 Hours private studies
- 45 Hours in-classroom work
| |
Contents of teaching: | - Hamiltonian graphs and degree sequences
- Menger's theorem - new proofs
- Matchings and decompositions of graphs
- The theorems of Turan and Ramsey
- Vertex and edge colourings
- The four colour theorem
| |
Qualification-goals/Competencies: - Ability to solve discrete problems using graph theoretical methods
- Knowledge of proof techniques and ideas of discrete mathematics
- Knowledge of fundamental and selected recent research results
|
Grading through: |
Requires: |
Responsible for this module: Teachers: |
Literature: - F. Harary: Graph Theory - Reading, MA:.Addison-Wesley 1969
- R. Diestel: Graphentheorie - Berlin: Springer 2000
- D. Jungnickel: Graphen, Netzwerke und Algorithmen - Mannheim: BI-Wissenschaftsverlag1994
- J. Bang-Jensen, G. Gutin: Digraphs: Theory, Algorithms and Applications - London: Springer 2001
- B. Bollobas: Modern Graph Theory - Berlin: Springer 1998
|
Language: |
Notes:Admission requirements for taking the module: - None (the competencies of the modules listed under ''Requires'' are required for this module, but are not a formal prerequisite). Admission requirements for taking module examination(s): - Successful completion of exercises as specified at the beginning of the semester. Module Exam(s): - MA3445-L1: Graph Theory, oral exam, 30 min, 100% of module grade. |
Letzte Änderung: 3.11.2021 |
für die Ukraine