Back to Discover
🔢

Clique problem

math Maturity 11-13

Imagine a group of friends.

6n-graf-clique.svg
6n-graf-clique.svg
Every person in the group knows everyone else. This is called a clique. It helps us find groups of friends. It can even help us study tiny parts of life. Can you find a group of friends?

43 words
🖼️ Images & Media (8)
File:Brute force Clique algorithm.svg
Brute force Clique algorithm.svg
File:6n-graf-clique.svg
6n-graf-clique.svg
File:Permutation graph.svg
Permutation graph.svg
File:Planted clique 15,32.svg
Planted clique 15,32.svg
File:Sat reduced to Clique from Sipser.svg
Sat reduced to Clique from Sipser.svg
File:Monotone circuit for 3-clique.svg
Monotone circuit for 3-clique.svg
File:Decision tree for 3-clique no arrowheads.svg
Decision tree for 3-clique no arrowheads.svg
File:Cube-face-intersection-graph.svg
Cube-face-intersection-graph.svg
Up Next
🔢
Clique (graph theory)
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Clique (graph theory) 0% Vertex cover 0% Maximum-cardinality matching 0% Travelling salesman problem 0% Edge cover 0% Graph isomorphism problem 0%

🔬 Go deeper

More advanced topics to explore

Vertex cover Maximum-cardinality matching Travelling salesman problem Graph isomorphism problem

🪜 Step back

Simpler topics to build understanding

Clique (graph theory) Edge cover Crossing number (graph theory) Graph homomorphism
📚 Content adapted from Wikipedia | Readability: FK 12.3 | Vital Level 5