Clique Number Calculator
Find the maximum clique - a set of vertices where every pair is connected.
Graph Input
Maximum Clique
{v0, v1, v2, v3}
These vertices form a complete subgraph (every pair is connected).
Vertex Degrees
v0
3
v1
3
v2
3
v3
4
v4
1
Clique Number
omega(G) = 4
Vertices
5
Edges
7
Max Degree
4
Avg Degree
2.80
Related Parameters
Clique Cover Lower Bound2
omega ≤ chi (chromatic number)Always true
omega(G) = alpha(complement)By definition
About Clique Number
- A clique is a complete subgraph (all vertices connected)
- omega(G) is the size of the maximum clique
- omega(G) is a lower bound for chi(G)
- Finding maximum clique is NP-hard
- Random graphs have small cliques (Ramsey theory)
💡
Help us improve!
How would you rate the Clique Number Calculator?
Editorial Note
MyCalcBuddy Editorial Team
This page is maintained as an educational calculator reference.
📚
Formula Source: Handbook of Mathematical Functions
by Abramowitz & Stegun
🔄Last reviewed: May 2026
✓Formula checks are based on standard references and internal QA review.