On the double competition number

It is known, that for almost alln-vertex simple graphs one needs Ω(n43(log n)−43) extra vertices to obtain them as a double competition graph of a digraph. In this note a construction is given to show that 2n43 are always sufficient.