A definition says

"A clique is a graph that has an edge connecting every pair of vertices"

but from my understanding, an edge connects only two vertices. Like $A-B$.

If we want to connect three vertices. We need at least two edges. For example, $A-B-C$.

I don't understand how an edge can connect every pair of vertices.

My definition says

A clique is a graph that has an edge connecting every pair of vertices

but as I understand, an edge connects only two vertices. Like $A-B$.

If we want to connect three vertices, we need at least two edges. For example, $A-B-C$.

I don't understand how an edge can connect every pair of vertices.

"A clique is a graph that has an edge connecting every pair of vertices"

From my understanding, an edge connects only two vertices. Like $A-B$.

If we want to connect three vertices. We need at least two edges. For example, $A-B-C$.

I don't understand how an edge can connect every pair of vertices.

A definition says

"A clique is a graph that has an edge connecting every pair of vertices"

but from my understanding, an edge connects only two vertices. Like $A-B$.

If we want to connect three vertices. We need at least two edges. For example, $A-B-C$.

I don't understand how an edge can connect every pair of vertices.