Algebraic Combinatorics

A.Y. 2016/2017
6
Max ECTS
42
Overall hours
SSD
MAT/02
Language
Italian
Learning objectives
The aim of this course is to introduce Graph Theory and some applications
Expected learning outcomes
Achievements: knowledge of the main applications of Graph Theory.
Course syllabus and organization

Single session

Responsible
Lesson period
First semester
Course syllabus
1. Introduction
Definitions and examples - Equivalence -labelled graphs- Subgraphs
2. Eulerian graphs
Konigsberg Bridge Problem. The Chinise postman's problem
3. Hamiltonian graphs
The travelling salesperson problem. A shortest-path algorithm
4. Tournaments
5. Trees
Terminoly and chracterizations of trees-Spanning trees and minimal spanning trees
Network models. The max flow min cut theorem
6.P lanar graphs
Definitions and Kuratowski's Theorem
7. Matrices and Graphs
Latin squares
8. Matching
Hall's marriage theorem- menger's theorem and its applications
9. Applications to group theory
MAT/02 - ALGEBRA - University credits: 6
Lessons: 42 hours
Professor(s)
Reception:
by appointment via e-mail
office 1014, Via Saldini 50