Combinatorics
Course objectives
General objectives: to acquire the basic knowledge and techniques of the Theory of graphs and Hypergraphs, in its algebraic and extremal aspects, and on the theory of algebraic codes. Specific objectives: Knowledge and understanding: at the end of the course the student will have acquired the basic notions and results related to the Theory of graphs and Hypergraphs, in its algebraic and extremal aspects, and on the theory of algebraic codes (with particular regard to algorithms on graphs, representation with trees, cycles, linear orderings, random generation) and Ramsey Theory. She will also know at least the set of the most significant problems in which these theories find applications. Apply knowledge and understanding: the student will be able to solve algebraic-combinatorial problems in graphs theory and Theory of algebraic codes, requiring the use of related techniques, and to discuss how problems (in non-purely mathematical environments) can be modeled by means of the acquired tools. Critical and judgmental skills: the student will have the basis to analyze how the topics of Graph and coding theory an find applications in different fields and be an essential tool in solving concrete problems. Communication skills: The learner will have the ability to communicate rigorously the ideas and contents shown in the course. Learning skills: the acquired knowledge will allow the student to carry on an autonomous study in a possible interdisciplinary context (for those who have knowledge and interests in Applied Mathematics, Genetics, Computer Science, Data Science).
Program - Frequency - Exams
Course program
Prerequisites
Books
Frequency
Exam mode
Lesson mode
- Lesson code10605748
- Academic year2025/2026
- CourseApplied Mathematics
- CurriculumMatematica per Data Science
- Year2nd year
- Semester1st semester
- SSDMAT/02
- CFU6