No Triangular Cycles Please!
Given a set of 6 arbitrary vertices, as shown, what is the maximum number of straight edges we can draw such that no cycle subgraph of 3 vertices exists?
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!