Improving colour computations in MadGraph5_aMC@NLO and exploring a $$1/N_c$$ <math> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>N</mi> <mi>c</mi> </msub> </mrow> </math> expansion

In this paper, we present an extension of MadGraph5_aMC@NLO which is able to evaluate tree-level QCD matrix-elements up to $$2\rightarrow 6$$ 2 → 6 (one more particle than before). To achieve this, we implemented Berends–Giele-like recursion, and re-implemented the way colour is computed such that we can now expand the colour matrix in powers of $$1/N_c$$ 1 / N c and truncate this expansion to a chosen order. For high multiplicity samples, even without truncating the colour matrix, the new implementation offers a speed gain compared to the previous MadGraph5_aMC@NLO code.