30 Jan
2014
30 Jan
'14
6:34 p.m.
I can prove f(6)=2 and f(7)=3. An upper bound on F(n) which shows this is: the maximum number of triangles in an n-vertex graph G, where only G which do not contain <|> as a 4-vertex subgraph, are allowed. This function of n is also interesting by itself, and I do not know what it is. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)