1. SylabUZ
2. Wydział Matematyki, Informatyki i Ekonometrii
3. semestr zimowy 2023/2024
4. Computer science and econometrics - drugiego stopnia z tyt. magistra
5. Topics in Discrete Mathematics

Wygeneruj PDF dla tej strony

Topics in Discrete Mathematics - opis przedmiotu

Cel przedmiotu

Gaining advanced knowledge of discrete mathematics in both theoretical and algorithmic aspects.

Wymagania wstępne

Zapisz zmiany

Discrete Mathematics 1

Zakres tematyczny

Lectures/classes

1. Selected graph classes and their properties.
2. Selected digraph classes and their properties.
3. Digraph algorithms.
4. Networks: activity network, flows in networks.
5. Hypergraphs, basic properties, and representations.
6. Cycles in hypergraphs.
7. Conformal hypergraphs, Helly's property.
8. Coloring of hypergraphs.

Metody kształcenia

Lecture: conventional, conversational.

Classes: classical problem-solving method.

Efekty uczenia się i metody weryfikacji osiągania efektów uczenia się

Opis efektu	Symbole efektów	Metody weryfikacji	Forma zajęć

Warunki zaliczenia

Final grade for the course:

average of positive grades from classes and the exam.

To pass the classes, obtaining a positive grade in written tests, active participation in classes, and a prepared presentation is required.

To pass a written test, obtaining a minimum number of points set for that particular test is required. The condition for taking the exam is to receive a positive grade for the classes.

Literatura podstawowa

1.  J. Bang-Jensen, G. Gutin, Digraphs, Theory and Algorithms, 2001.
2. C. Berge, Graphs and Hypergraphs, North-Holla nd, Amsterdam, 1973.
3. R. Distel, Graph Theory, Springer-Verlag, New York 1997.
4. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics 57, Elsevier, 2004.

Literatura uzupełniająca

1. A. Brandstadt, V.B. Le, J.P. Spinrad, Graph Classes: a survey, SIAM 2004

Uwagi

The course is also offered in the  semester IV.

Zmodyfikowane przez dr Ewa Synówka (ostatnia modyfikacja: 10-04-2024 21:14)