### 2.5.14. Related

Denotes the fact that a constraint ${C}_{\mathrm{\pi \pi \pi ‘\pi \pi ¦}}$ and a constraint are related by a specific reason that is not covered by an existing link.

EXAMPLE: As an example, the constraint $\mathrm{\pi \pi \pi \pi }_\mathrm{\pi \pi \pi \pi \pi }$ (i.e.,Β given a digraph, partition it so that each vertex belongs to one tree for which the difference between the longest and the shortest paths β from a leaf to the root β is restricted) is related to the constraint ${C}_{\mathrm{\pi \pi \pi ‘\pi \pi ¦}}=$ $\mathrm{\pi \pi \pi \pi \pi \pi \pi }$ (i.e.,Β given a set of variables, restrict the difference between the number of occurrence of the value that occurs the most and the value that occurs the least) by the fact that, on the one hand the constraint $\mathrm{\pi \pi \pi \pi }_\mathrm{\pi \pi \pi \pi \pi }$ can express a balanced tree, on the other side the constraint $\mathrm{\pi \pi \pi \pi \pi \pi \pi }$ can express a balanced assignment.