Embedding maximal cliques of sets in maximal cliques of bigger sets

doi:10.1016/0012-365X(86)90140-8

Discrete Mathematics

Volume 58, Issue 3, March 1986, Pages 229-242

https://doi.org/10.1016/0012-365X(86)90140-8 Get rights and content

Under an Elsevier user license

open archive

Abstract

Characterizations are obtained of the maximal (k + s)-cliques that contain a given maximal k-clique as a substructure: (1) when s = 1; (2) for arbitrary s when no line of the clique contains exactly one point of the subclique. These characterizations are used to obtain maximal cliques which have fewer lines (for given k) than previously known examples.

Cited by (0)

^∗: The research for this paper was conducted with the support of NSF grant MCS-8301351.