Hypergraph matching hypergraph =(V,E) vertex set V hyperedge e∈E,eCV a matching is an subset MCE of disjoint hyperedges partition .U] Zλ(H)= ∑ λM川 .U4 i. functions: M:matching of H ,5 .29 8 es .6 e2 es Gibbs λXM distribution: u(M)= Z(孔)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 Hypergraph matching Z￾(H) = X M: matching of H ￾|M| hypergraph H = (V,E) vertex set V hyperedge e 2 E, e ⇢ V a matching is an subset M⊂E of disjoint hyperedges µ(M) = ￾|M| Z￾(H) partition functions: Gibbs distribution: