1. komponenta

Lecture type	Total
Lectures	45

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES:
To understand fundamental concepts, theorems, and algorithms in graph theory and to solve related problems.

COURSE DESCRIPTION AND SYLLABUS:
- Vertex and edge connectivity, 2-connectivity, Mader's theorem, Menger's theorem, Ford-Fulkerson algorithm
- Matchings, Hall's theorem, Kőnig's theorem, Tutte's condition, minimum matching algorithm in bipartite graphs
- Graph coloring, greedy coloring, Brooks' theorem, Five-Color theorem, Gallai-Roy theorem, Vizing's theorem
- Matrix-tree theorem, Cauchy-Binet formula
- Algebraic methods, eigenvalues of graphs, strongly regular graphs, PageRank algorithm
- Probabilistic method and Ramsey theory
- Extremal graph theory: Turán's theorem, Kővári-Sós-Turán theorem

1. Graph Theory, 3rd ed. https://diestel-graph-theory.com/basic.html, Reinhard Diestel, Berlin; Heidelberg: Springer-Verlag, 2005.
2. Graph Theory, bilješke sa Sveučilišta u Cambridgeu. ( https://ak2316.user.srcf.net/files/ii-graph-theory/graph-theory.pdf ), Julian Sahasrabudhe.

Ostali izborni predmeti - Regular study - Computer Science and Mathematics

Ostali izborni predmeti - Regular study - Computer Science and Mathematics

Izborni predmet 3, 4, 5, 6 - Regular study - Computer Science and Mathematics

Izborni predmet 3, 4, 5, 6 - Regular study - Computer Science and Mathematics