COMPSCI 575/MATH 513: Combinatorics and Graph Theory

Solutions to Final Exam, Fall 2018

David Mix Barrington

17 December 2018

Solutions posted 4 January 2019


  Q1: 20 points
  Q2: 20+10 points
  Q3: 40 points
  Q4: 20 points
  Q5: 20 points
Total: 120+10 points

Exam text is in black, solutions in blue.

The undirected graph G has node set {a, b, c, d, e, f| and the following set of nine edges:

{(a, b), (a, c), (b, c), (c, d), (c, e), (c, f), (d, e), (d, f), (e, f)}

Last modified 6 January 2019