Nobel Prize in Economics
     
  Algorithms Textbook 

Categories




Most popular tags

recurrence-relations time-complexity asymptotic-analysis loops graph asymptotic-notation dynamic-programming greedy substitution-method a-star np-completeness nested-loops vertex-coloring analysis mdp log probability stochastic heuristic master-theorem markov-model n-puzzle csp graph-coloring exam mvcs small-oh exponent proof viterbi bayes-rule hmm tree-search grid-world admissible n-queens conflict ai clique coins reduction dfs prime-numbers sqrt count easy sorted-lists logn example recursive gcd independent-set unsolvable pcp counter-example not-master-theorem modulus algebra most-likely-estimate reinforcement-learning direct-evaluation meu articulation-point hotel-room small-omega limit-method mle graph-search while-loop greedy-suboptimal job-assignment maximize-value gold constraint-satisfaction-problem 8-puzzle task-environments min-max peak randomized satisfiability random-graph-generation proxy network sudoku branchandbound d&c degree-constrained spanning-tree vertex-cover branch subtree series pmi bound contradiction math backtracking tree minimize floors

Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices

0 votes
Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices
in Graph Theory by AlgoMeister (1.6k points)

3 Answers

+2 votes
 
Best answer

No any triangle.

by Active (292 points)
selected by
+1 vote

The graph has 6 vertices, 9 edges and max clique of 2 vertices.

by AlgoStar (404 points)
0 votes
/Users/yingliu/Downloads/IMG_61E92A670424-1.jpeg

Here is my answer.
by (212 points)
reshown by

Related questions

+1 vote
5 answers
Graph with no 3-clique that needs at least 4 colors
asked Jul 24, 2017 in Graph Theory by Amrinder Arora AlgoMeister (1.6k points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
The Book: Analysis and Design of Algorithms | Presentations on Slideshare | Lecture Notes, etc
...