About the 1999 Topic

Research Program

Education Program

General Information



DREI '99 Home

  Research Program **

Week 1 Topic
Matchings in Graphs and their Applications
July 19 - 23, 1999

Chair:Brian Alspach, Simon Fraser University, alspach@cs.sfu.ca



Speakers & Participants


A k-matching in a multigraph X is a set of k edges no two of which have a vertex in common. If every vertex of X lies on some edge of the matching, then the matching is called a perfect matching (or 1-factor). If the edges of X have weights, then the matching is called a weighted matching.

Matchings, weighted matchings and perfect matchings are of theoretical interest in graph theory and have several significant applications. This week will consider past work and current work dealing with matchings and several generalizations. Other topics in graph theory having some connection with matchings also will be considered.