First cycle
degree courses
Second cycle
degree courses
Single cycle
degree courses
School of Science
MATHEMATICS
Course unit
DISCRETE MATHEMATICS
SC04105572, A.A. 2017/18

Information concerning the students who enrolled in A.Y. 2015/16

Information on the course unit
Degree course First cycle degree in
MATHEMATICS
SC1159, Degree course structure A.Y. 2008/09, A.Y. 2017/18
N0
bring this page
with you
Number of ECTS credits allocated 6.0
Type of assessment Mark
Course unit English denomination DISCRETE MATHEMATICS
Website of the academic structure http://matematica.scienze.unipd.it/2017/laurea
Department of reference Department of Mathematics
Mandatory attendance No
Language of instruction English
Branch PADOVA
Single Course unit The Course unit can be attended under the option Single Course unit attendance
Optional Course unit The Course unit can be chosen as Optional Course unit

Lecturers
Teacher in charge MICHELANGELO CONFORTI MAT/09

Mutuated
Course unit code Course unit name Teacher in charge Degree course code
INP7080667 GRAPH THEORY MICHELANGELO CONFORTI IN2371
INP7080667 GRAPH THEORY MICHELANGELO CONFORTI IN2371

ECTS: details
Type Scientific-Disciplinary Sector Credits allocated
Core courses MAT/09 Operational Research 6.0

Mode of delivery (when and how)
Period Second semester
Year 3rd Year
Teaching method frontal

Organisation of didactics
Type of hours Credits Hours of
teaching
Hours of
Individual study
Shifts
Practice 3.0 24 51.0 No turn
Lecture 3.0 24 51.0 No turn

Calendar
Start of activities 26/02/2018
End of activities 01/06/2018

Examination board
Board From To Members of the board
6 Matematica Discreta - 2017/2018 01/10/2017 30/09/2018 CONFORTI MICHELANGELO (Presidente)
DI SUMMA MARCO (Membro Effettivo)
DE FRANCESCO CARLA (Supplente)
DE GIOVANNI LUIGI (Supplente)
RINALDI FRANCESCO (Supplente)

Syllabus
Prerequisites: None.
Target skills and knowledge: Introduction to graph theory and discrete mathematics.
Examination methods: Written exam.
Assessment criteria: By solving exercises, the student is required to demonstrate his/her knowledge of the subject and ability to prove simple results.
Course unit contents: - Preliminary definitions on graphs
- Edge-conenctivity and Menger Theorem
- Vertex-connectivity
- Minimum-weight spanning tree
- k-connected graphs
- Matchings and edge-colorings
- Planarity
- Vertex-colorings and 4-color Theorem
- Hamiltonian cycles and Eulerian tours
Planned learning activities and teaching methods: Theory and exercises.
Additional notes about suggested reading: Course notes will be provided.
Textbooks (and optional supplementary readings)
  • A. Bondy, U. S. Murty, Graph Theory. --: Springer, 2008. Cerca nel catalogo