Colouring Problems and Transversals in Graphs

Document Type

Presentation Abstract

Presentation Date

9-6-2002

Abstract

Let G be a graph whose vertex set is partitioned into classes V1 ∪... ∪ Vi. An independent transversal of G with respect to the given classes is an independent set {v1,...,vi} in G such that vi ∈ Vi for each i. We give conditions that guarantee the existence of an independent transversal in a graph with specified vertex classes, and we show how various colouring and matching problems can be addressed using these results.

Additional Details

This talk is part of The Big Sky Conference, and is sponsored in part by the National Science Foundation and the Department of Mathematical Sciences.

Friday, 6 September 2002
4:10 p.m. in James E Todd Building 203-204
Reception at 3:30 p.m. 204

This document is currently not available here.

Share

COinS