Throughput region of an interference graph
= Throughput region of an interference graph
{title2=$\Lambda=\operatorname{conv}S$}
For feasible <independent set> activation vectors $S$, the throughput region is their <convex hull>. Its downward closure is the same set because deleting active vertices preserves feasibility. Ideal <carrier-sense multiple access> can supply strict margins above every vector in its interior by adjusting attempt rates.