Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

complete graph

A graph on n vertices where every pair of distinct vertices is joined by an edge.

The complete graph $K_n$ has $V(K_n)$ of size $n$ and every possible edge present: $\binom{n}{2}$ edges total.

Read the full section →

snap pen only

Graph settings

indep dep deg

grid intersections

xmin xmax ymin ymax

x-tick y-tick

Calculator