We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Hey guys. I guess some of you have wiki-ed turan graph, where you get the number of edges in T(n,r) is floor(n^2(r-1)/2r). It seems that this is just a lower bound. In order to solve this problem, we need to write our own function to compute the number of edges in T(n,r)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Clique
You are viewing a single comment's thread. Return to all comments →
Hey guys. I guess some of you have wiki-ed turan graph, where you get the number of edges in T(n,r) is floor(n^2(r-1)/2r). It seems that this is just a lower bound. In order to solve this problem, we need to write our own function to compute the number of edges in T(n,r)