Large Sets and Overlarge Sets of Triangle-Decomposition
β Scribed by Zi-hong Tian; Qing-de Kang
- Book ID
- 106301203
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2007
- Tongue
- English
- Weight
- 206 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this article, we construct overlarge sets of disjoint S(3, 4, 3 n -1) and overlarge sets of disjoint S(3, 4, 3 n + 1) for all n β₯ 2. Up to now, the only known infinite sequence of overlarge sets of disjoint S(3, 4, v) were the overlarge sets of disjoint S(3, 4, 2 n ) obtained from the oval conics
## Abstract Let __G__=(__V__(__G__),__E__(__G__)) be a graph. A (__n__,__G__, Ξ»)β__GD__ is a partition of the edges of Ξ»__K__~__n__~ into subgraphs (__G__βblocks), each of which is isomorphic to __G__. The (__n__,__G__,Ξ»)β__GD__ is named as graph design for __G__ or __G__βdecomposition. The large s