Embedding maximal cliques of sets in maximal cliques of bigger sets
β Scribed by David A Drake
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 887 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimension n over the field of q elements, with two vertices being adjacent if the rank of their difference is 1 or 2. The classification of the maximal cliques of Quad(n, q), for q even, is herein complete
In this article, we prove that there exists a maximal set of m Hamilton cycles in K n,n if and only if n/4 < m β€ n/2.
A finite family of pairwise intersecting r-sets is a maximal r-clique if it cannot be extended to another r-clique by adding a new r-set. It is intersection critical if it is not possible to replace any edge by some of its proper subsets, without violating the intersection property. We prove that i