Tessellate S.T.E.M.S. (2019) - Computer Science - College - Set 3 - Objective Problem 5

Computer Science Level 2

Consider the following operation on a graph: take any 4 cycle and remove one of its edges. Starting from the complete graph on n n vertices, what is the smallest number of edges one can end up with?

This problem is a part of Tessellate S.T.E.M.S (2019)

n 2 \frac{n}{2} n n log ⁡ 2 n \log_2 n 3 3

Tessellate Stems Computer Science by Tessellate STEMS Compute… , 27

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...