Course Information
SemesterCourse Unit CodeCourse Unit TitleL+PCreditNumber of ECTS Credits
8MATH408ADVANCED TOPICS IN GRAPH THEORY3+036

Course Details
Language of Instruction English
Level of Course Unit First Cycle
Department / Program MATHEMATICS
Mode of Delivery Face to Face
Type of Course Unit Elective
Objectives of the Course The goal of this course is to further the knowledge of mathematics students in Graphy theory and give them the necessary knowledge for independent research. Moreover, it aims to further improve and develope the skill of Computer Engineering, Bioinformatic and Electronics students to apply Graph theoretic tools in their own reseach problems.
Course Content
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Associate Prof.Dr. Berkant Ustaoğlu
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources D. West “Introduction to Graph Theory” Pearson
J.A. Bondy, U. S. R. Murty “Graph Theory” Springer

Course Category

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm exams 2 % 20
Quizzes 0 % 0
Homeworks 4 % 10
Other activities 0 % 0
Laboratory works 0 % 0
Projects 0 % 0
Final examination 1 % 20
Total
7
% 50

ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Weekly Course Time 42 1 42
Outside Activities About Course (Attendance, Presentation, Midterm exam,Final exam, Quiz etc.) 14 7 98
Exams and Exam Preparations 7 6 42
Total Work Load   Number of ECTS Credits 6 182

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 To be able to prove basic discrete mathematics
2 To analyze problems and devise appropriate modelling structures.
3 To demonstrate the ability to abstract
4 To identify some hard problems in computer science and discrete mathematics.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Connectivity D. West “Introduction to Graph Theory” Pearson
2 k-connected graphs and applications of Menger`s theorem D. West “Introduction to Graph Theory” Pearson
3 Planar graphs: Kuratowski`s theorem D. West “Introduction to Graph Theory” Pearson
4 Parameters of planarity, embeddings and crossing number D. West “Introduction to Graph Theory” Pearson
5 Network flow problems D. West “Introduction to Graph Theory” Pearson
6 Min-cut Max-flow theorem and consequences D. West “Introduction to Graph Theory” Pearson
7 Structure of k-chromatic graphs D. West “Introduction to Graph Theory” Pearson
8 Perfect graphs D. West “Introduction to Graph Theory” Pearson
9 Ramsey Theory D. West “Introduction to Graph Theory” Pearson
10 Extremal graph theory D. West “Introduction to Graph Theory” Pearson
11 Probabilistic methods D. West “Introduction to Graph Theory” Pearson
12 Random graphs D. West “Introduction to Graph Theory” Pearson
13 Eigenvalues and eigenvectors of graphs D. West “Introduction to Graph Theory” Pearson
14 Topics in matroid theory D. West “Introduction to Graph Theory” Pearson
15 Final 1st week D. West “Introduction to Graph Theory” Pearson
16 Final 2nd week D. West “Introduction to Graph Theory” Pearson


Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14
C1 4 4 1 4 1 1 3 1 4 3 1
C2 4 4 1 4 2 4 3 4 4 3 1
C3 4 2 2 4 3 4 4 1 4 4 2
C4 4 3 4 2 3 3 3 3 4 4

Contribution: 0: Null 1:Slight 2:Moderate 3:Significant 4:Very Significant


https://obs.iyte.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=163205&lang=en