= Solution
The <constraint graph> has <vertices> $A,B,C,D,E,F,G$ and the thirteen <edges> listed in (a). The following original drawing distinguishes named shared-audience <edges> from the additional society-overlap <edges>. <Vertex> colours show one valid slot assignment; they are not extra constraints.
\Image[/past-exam-of-the-computer-science-course-of-the-university-of-oxford/2021/artificial-intelligence-schedule-graph.png]
{title=The scheduling constraint graph with direct conflicts and explicitly assumed society overlaps}
The unary restriction $X_A=1$ is a <constraint domain> restriction and adds no <edge>. For reference, $E$ is adjacent to every other <vertex>; among the remaining <vertices> there is a triangle $ABG$, a cycle $BDFG$, and the <edge> $CD$.
Back to article page
