Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Is it true that any undirected graph is a union of maximal cliques? Since an edge is a size 2 clique?

share|cite|improve this question
It seems obvious for finite graphs. I think that cliques satisfy Zorn's lemme, so in particular, every edge is in a maximal clique in the infinite case, too. – Thomas Andrews Jan 11 '13 at 23:33

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.