Characterizing trade-offs between simultaneous violations of multiple Bell inequalities in a large network of qubits is computationally demanding. We propose a graph-theoretic approach to efficiently produce Bell monogamy relations in arbitrary arrangements of qubits. All the relations obtained for bipartite Bell inequalities are tight and leverage only a single Bell monogamy relation. This feature is unique to bipartite Bell inequalities, as we show that there is no finite set of such elementary monogamy relations for multipartite inequalities. Nevertheless, many tight monogamy relations for multipartite inequalities can be obtained with our method as shown in explicit examples.

1 aTran, Minh, C.1 aRamanathan, Ravishankar1 aMcKague, Matthew1 aKaszlikowski, Dagomir1 aPaterek, Tomasz uhttps://arxiv.org/abs/1801.03071