Anu007 Sir though I didn't think it in this way earlier but then we can take infinitely many no. of K5 in the graph to maximize the no. of edges..but the answer should be some finite one..so this assumption can be safely made..Please correct me
@Anu007, sir
in the question they mentioned DFS, if it is really disconnected the term would be replace by DFT
64.3k questions
77.9k answers
244k comments
80.0k users