Graph Theory

Subject:

Combinatorics & Optimization (CO)

Catalog number:

642

Unit weight:

0.50

Meet type:

LEC

Grading basis:

NUM

Cross-listing(s):

N/A

Requisites:

N/A

Description:

Colouring: Brooks' Theorem and Vizing's Theorem. Flows: integer and group-valued flows, the flow polynomial, the 6-flow theorem. Extremal graph theory; Ramsey's theorem, Turan's theorem, Mader's theorem on graphs with no n-clique-minor. Probabilistic methods: Lower bounds for Ramsey numbers, graphs with large girth and chromatic number.

Topic titles:

N/A

Faculty:

Mathematics (MAT)

Academic level:

GRD

Course ID:

000245