Therefore Bézout’s lemma can be applied to both equations. The graph G=(VG,EG) is defined as before, with a vertex v∗ for every v∈VH and a vertex e∗ for every e∈EH, with paths on x1 edges and cycles C(e) on x2 edges. The arguments in Lemmas 3.1 and 3.2 can easily...