What is the maximum number of edges that a graph with nodes can have if every path of length 2 in G is an induced subgraph?
Note: This is a difficult problem.