论文信息 - Embedding maximal cliques of sets in maximal cliques of bigger sets

Embedding maximal cliques of sets in maximal cliques of bigger sets

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.

David A. Drake | D. A. Drake

[1] J. C. Meyer. Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets , 1974 .

[2] Sharad S. Sane,et al. Maximal intersecting families of finite sets and n-uniform Hjelmslev planes , 1982 .

[3] R. H. Bruck. Finite nets. II. Uniqueness and imbedding. , 1963 .

[4] Helmut Maier,et al. Primes in short intervals. , 1985 .

[5] Aart Blokhuis. On subsets of GF(q2) with square differences , 1984 .

[6] L. Lovász,et al. Remarks on a theorem of Redei , 1981 .

[7] Ronald C. Read,et al. Graph theory and computing , 1972 .

[8] Zoltán Füredi,et al. On Maximal Intersecting Families of Finite Sets , 1980, J. Comb. Theory, Ser. A.

[9] J. Dénes,et al. Latin squares and their applications , 1974 .