✦ LIBER ✦
Packing pentagons into complete graphs: how clumsy can you get?
✍ Scribed by Alexander Rosa; Štefan Znám
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 750 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A pentagonal packing PP(n; t) is a family of t edge-disjoint pentagons in the complete graph K.. A pentagonal packing is maximal if the complement of the union of its pentagons is pentagon-free.
The spectrum S@'(n) for maximal pentagonal packings is the set of sizes t such that there exists a maximal PP(n; t). We determine the extremes of the spectrum S@'(n) for all n. Our results may be viewed as an extension of similar results for maximal partial Steiner triple systems.