matchings in hypergraphs of max-degree sk+1 and max-edge-sizes d+1 matching 01 .4 th2. incidence graph primal: .5 ,28 e3 6 9 e2 e3 5 6 dual: CSP defined by matching(packing)constraint 7 06 independent set independent sets in hypergraphs of max-degree sd+1 and max-edge-size sk+1 independent sets:a subset of non-adjacent vertices (to be distinguished with:vertex subsets containing no hyperedge as subset)v3 e1 v1 v2 v4 v8 v7 e2 e3 e5 v9 v6 v5 e4 v1 v2 v3 v4 v5 v6 v7 v8 v9 e1 e2 e3 e4 e5 matchings in hypergraphs of max-degree ≤ k+1 and max-edge-size ≤ d+1 v3 e1 v1 v2 v4 v8 v7 e2 e3 e5 v9 v6 v5 e4 * * * * * * * * * * * * * * v5 * v6 * e2 * v1 * v2 * e1 * v3 * v4 * e5 * e3 * e4 * v7 * v8 * v9 * incidence graph primal: dual: v3 e1 v1 v2 v4 v8 v7 e2 e3 e5 v9 v6 v5 e4 * * * * * * * * * * * * * * v5 * v6 * e2 * v1 * v2 * e1 * v3 * v4 * e5 * e3 * e4 * v7 * v8 * v9 * matching independent set CSP defined by matching(packing) constraint independent sets in hypergraphs of max-degree ≤ d+1 and max-edge-size ≤ k+1 independent sets: a subset of non-adjacent vertices (to be distinguished with: vertex subsets containing no hyperedge as subset)