Assertion: clique | /r/CapableOf | have at most four vertices
Facets:
value: by kuratowski's theorem
type: OTHER
value: for planar graphs
type: OTHER
Source sentences:
text: In particular, for planar graphs, any clique can have at most four vertices, by Kuratowski's theorem.