CSP (Constraint Satisfaction Problem) degree degree =2 max-degree≤d ≤d 8 matching constraint matchings: variables xi∈{0,1} (at-most-1) matching constraint independent sets: variables i∈{0，l} (at-most-1) partition function: Z= 入川1 i∈{0，l}n satisfying all constraintsCSP (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: independent sets: variables xi 2 {0, 1} matching constraint (at-most-1) matching constraint (at-most-1) variables xi 2 {0, 1} max-degree ≤ d partition function: Z = X ~x2{0,1}n satisfying all constraints ￾k~xk1 degree ≤ d degree = 2