2 problems

Higher-dimensional max-flow min-cut conjecture. There exists a map $\mu$ on the unit sphere such that, for every convex set $A$ with $0$ in its interior,

Let $G$ be a perfect graph, and let $\mathcal{C}$ be its clique clutter, whose edges are the maximal cliques of $G$. The clutter $\mathcal{C}$ is ideal when its covering polyhedron…