CSP (Constraint Satisfaction Problem) 2 degree degree =2 max-degree≤d ≤d matching constraint matchings: variables xi∈{0,1} (at-most-1)CSP (Constraint Satisfaction Problem) 1 2 3 4 5 6 a b c d e f g 1 2 3 4 5 6 a b c d e f g matchings: variables xi 2 {0, 1} matching constraint (at-most-1) degree ≤ d degree = 2 max-degree ≤ d