We prove that the number of tringles (counted modulo an arbitrary prime of order log n) is almost uniquely distributed in random graph on n vertices.
