𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Overlarge sets and partial geometries
✍ Rudolf Mathon; Anne Penfold Street πŸ“‚ Article πŸ“… 1997 πŸ› Springer 🌐 English βš– 953 KB
Overlarge sets of disjoint Steiner quadr
✍ Luc Teirlinck πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

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

Large set of P3-decompositions
✍ Qingde Kang; Yanfang Zhang πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 113 KB

## 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