Given an undirected graph of size k and an edge (a, b), find a way more efficient than the post above you to check if that edge is part of a clique of size n.

Baseline: Check every possible n(n-1)/2-tuple of edges to see if a clique is formed.