NMAK15015U Graph Coloring
MSc programme in Mathematics
Coloring problems associated to graphs. Graphs and their chromatic numbers and chromatic polynomials. The Potts model, chromatic numbers of R^n, chromatic numbers of simplicial complexes, topological bounds on the chromatic number á la Lovasz etc.
Knowledge
|
To be announced.
- Category
- Hours
- Exercises
- 27
- Lectures
- 36
- Preparation
- 98
- Project work
- 45
- Total
- 206
As
an exchange, guest and credit student - click here!
Continuing Education - click here!
- Credit
- 7,5 ECTS
- Type of assessment
- Continuous assessment3 mandatory homework assignments.
- Aid
- All aids allowed
- Marking scale
- passed/not passed
- Censorship form
- No external censorship
One internal examiner
- Re-exam
Oral exam, 30 minutes without preparation time. Several internal examiners
Criteria for exam assesment
The student must in a satisfactory way demonstrate that he/she has mastered the learning outcome of the course.
Course information
- Language
- English
- Course code
- NMAK15015U
- Credit
- 7,5 ECTS
- Level
- Full Degree Master
- Duration
- 1 block
- Placement
- Block 3
- Schedule
- B
- Course capacity
- No limit
- Continuing and further education
- Study board
- Study Board of Mathematics and Computer Science
Contracting department
- Department of Mathematical Sciences
Course responsibles
- Søren Eilers (6-6f73766f7c7d4a776b7e7238757f386e75)
Lecturers
Michal Adamaszek