I don't have a formal proof yet, but can anyone give a counter test case to following:
Let f(n) be our function: if n is even: f(n) = (n^2)/4 else: f(n) = ((n-1)^2)/4 + (n-1)/2 On Wed, Sep 7, 2011 at 5:36 AM, Shuaib Khan <aries.shu...@gmail.com> wrote: > What is the maximum number of edges possible in a graph with N nodes, and > where any three nodes can have at most two edges between them. 1<=N<=100000. > > > -- > Shuaib > > -- Shuaib -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
