SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Selected Chapters on Combinatorics I - NDMI055
Title in English: Vybrané kapitoly z kombinatoriky I
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2019
Semester: winter
E-Credits: 3
Hours per week, examination: winter s.:2/0 Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: English, Czech
Teaching methods: full-time
Guarantor: prof. RNDr. Jaroslav Nešetřil, DrSc.
Mgr. Jan Hubička, Ph.D.
Class: DS, diskrétní modely a algoritmy
Informatika Mgr. - Diskrétní modely a algoritmy
Classification: Informatics > Discrete Mathematics
Annotation -
Last update: JUDr. Dana Macharová (01.10.2013)
The selection of topics from combinatorics in this course varies from year to year, but will include aspects of graph homomorphisms, graph polynomials (in particular the Tutte polynomial and related polynomials) and their applications (e.g. in statistical physics), and duality in combinatorics (e.g. colourings and flows, geometric duality, Ramsey duality, categorical duality). The course is offered to doctoral students, and will be given in English. Prerequisite for the course is a background in discrete mathematics and graph theory.
Literature -
Last update: (04.05.2015)

References will be given during the course and will depend on the syllabus.

Requirements to the exam - Czech
Last update: Mgr. Jan Hubička, Ph.D. (12.10.2017)

Zkouska je ustni, okruhy otazek pokryvaji temata dana sylabem predmetu s prihlednutim k latce odprednesene behem semestru.

Syllabus -
Last update: (04.05.2015)

The syllabus varies from year to year and is advertised at the beginning of the semester. Topics are usually centred around the Tutte polynomial and its applications, duality in combinatorics, or graph homomorphisms.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html