If we consider it as a graph, where the teams are nodes and an edge connecting two nodes refer to a game between them, it implies that this graph must not have any triangles. What is the maximum amount of edges possible like this for $8$ nodes?