Students will learn to classify combinatorics problems and solve them using known combinatorial methods.<\/p>\n
Graphs and subgraphs. Adjacency matrix and incidence matrix. Graph invariants. Paths and cycles – a
\nmore detailed approach. Cyclomatic number of a graph.\u00a0 Trees and their applications. Hamiltonian and Euler cycles and their application. Graph coloring – a more detailed approach. Planar and polyhedral graphs. Kuratowski-Pontryagin Theorem. Coloring of planar graphs. Graph matching and applications. Independent sets, coverings and cliques. Stability in a graph with the use in Code Theory. Use in Linear Algebra. Power of square matrix and Markov chains. Signal flow graphs. Ramsey graph theory. Oriented graphs, block designs, finite geometries and matroids.<\/p>\n
Solving tasks.<\/p>\n","protected":false},"excerpt":{"rendered":"
Objectives and outcomes Students will learn to classify combinatorics problems and solve them using known combinatorial methods. Lectures Graphs and subgraphs. Adjacency matrix and incidence matrix. Graph invariants. Paths and cycles – a more detailed … Read more<\/a><\/p>\n Read more<\/a>","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[199],"tags":[],"class_list":["post-13807","post","type-post","status-publish","format-standard","hentry","category-subjects"],"acf":[],"yoast_head":"\n