COMPSCI 575/MATH 513: Combinatorics and Graph Theory

Solutions to Midterm Exam, Fall 2018

David Mix Barrington

Exam given 25 October 2018

Solutions posted 14 November 2018


  Q1: 10 points
  Q2: 10 points
  Q3: 10 points
  Q4: 10 points
  Q5: 20 points
  Q6: 20+10 points
  Q7: 10 points
Total: 100+10 points

Question text is in black, solutions in blue

For Questions 1-4, the graph G has node set {a, b, c, d, e, f} and nine edges: (a, b), (a, c), (a, d), (b, c), (b, e), (c, f), (d, e), (d, f), and (e, f). Recall that "graph" refers to an undirected graph with no self-loops.

Last modified 14 November 2018