This problem reduce to find the triangle with 6 vertices. there must be the three node with either 3 or 5 outcomes (3,3,5) or (5,5,3) or more but not more than that, if the prime outcomes is more than three it will lead to K4, K5, or K6 so we only focus on K3 which is a cycle of three edges.
we know that the number of cycle 3 with n vertices is n(n-1)(n-2)/6 = 6*5*4/5 = 20
and total number of graph formed with probability is (1+1)^6 = 64
so 20/64 = 5/16