Consider an undirected graph with $n$ nodes. Is there an efficient data structure that supports the following operations?
- Insert an edge into the graph
- Delete an edge from the graph
- Given a query edge $(i,j)$, list all the triangles that include that edge. There can be $n$ of these in the worst case but ideally this operation would be sublinear if the number of triangles to be reported is.