Seminar in combinatorics and graph theory - NMUM365
Title: Seminář z kombinatoriky a teorie grafů
Form of teaching: seminar
Guaranteed by: Department of Mathematics Education (32-KDM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2016
Duration in semesters: 1
Semester: summer
E-Credits: 2
Hours per week, examination: summer s.:0/2, C [HT]
Capacity: unlimited
Maximum number of enrolled students: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: Czech
Teaching methods: full-time
Repeated enrollment: 2 / 2 / 2 / 2
Guarantor: doc. RNDr. Antonín Slavík, Ph.D., DSc.
Teacher(s): doc. RNDr. Antonín Slavík, Ph.D., DSc.
Class: M Bc. MZV
M Bc. MZV > Doporučené volitelné
Classification: Mathematics > Mathematics, Algebra, Differential Equations, Potential Theory, Didactics of Mathematics, Discrete Mathematics, Math. Econ. and Econometrics, External Subjects, Financial and Insurance Math., Functional Analysis, Geometry, General Subjects, , Real and Complex Analysis, Mathematics General, Mathematical Modeling in Physics, Numerical Analysis, Optimization, Probability and Statistics, Topology and Category
Opinion survey results   SS schedule   Noticeboard   
Annotation -
Optional course, free continuation of the basic combinatorics course. Solving problems from combinatorics, graph theory and recreational mathematics. Short introduction to advanced topics in combinatorics.
Last update: T_KDM (07.01.2015)
Course completion requirements - Czech

Podmínkou získání zápočtu je přednesení referátu.

Last update: Slavík Antonín, doc. RNDr., Ph.D., DSc. (29.04.2020)
Literature -
  • R. B. J. T. Allenby, A. Slomson: How To Count. An Introduction to Combinatorics, CRC Press, 2011.
  • J. M. Harris, J. L. Hirst, M. J. Mossinghoff: Combinatorics and Graph Theory, Springer, 2008.
  • J. Matoušek, J. Nešetřil: Kapitoly z diskrétní matematiky, Karolinum, 2000.
  • R. L. Graham, D. E. Knuth, O. Patashnik: Concrete Mathematics, Addison-Wesley, 1994.

Last update: T_KDM (28.04.2014)
Syllabus -

Preliminary sylabus:

  • Tiling problems in combinatorics
  • Pick's theorem
  • Nonstandard dice sets
  • Number-theoretic properties of binomial numbers
  • Stirling numbers
  • Discrete calculus
  • Unimodal sequences
  • Chess problems in combinatorics
  • Art gallery theorem

Last update: T_KDM (24.04.2017)