all_edge_triangle (272B)
1 # all edge triangle 2 3 Problem of deciding, given an undirected [graph], for each edge, whether it is in a [triangle] 4 5 This requires time Omega(n^{2-o(1)}) assuming [3sum_hypothesis] 6 7 See also: [st_reachability], [triangle_detection] 8 9 Up: [computational_problem] on [graph]