Let g be a perfect graph with vertex set x x1xn and let s

Question

Let cl(G) be the clique clutter of a perfect graph G. If cl(G) is d-uniform and satisfies the packing property, prove that cl(G) satisfies the max-flow min-cut property? Let G be a perfect graph with vertex set X = {x₁,...,x_n} and let S be the subring generated by all xat such that supp(xa) is a clique of G. Prove that S is normal