"what is the maximum number of edges a graph with 6 vertices can have with no cycles of length 3"
i'm assuming there can be cycles of more than 3
i got 9
BUT i want to know what the pattern is if one exists. I know there is one for planar graphs (Kuratowski's theorem) but what if they...