𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal packings of K4's into a Kn

✍ Scribed by A.E. Brouwer

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
957 KB
Volume
26
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The metamorphosis of λ-fold block design
The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles
✍ Selda Küçükçifçi; C.C Lindner; A Rosa 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 281 KB

Let (X; B) be a -fold block design with block size four and deÿne sets B(C) and E(K4 \ C) as follows: for each block b ∈ B, partition b into a 4-cycle and a pair of disjoint edges and place the 4-cycle in B(C) and the 2 disjoint edges in E(K4 \ C). If we can reassemble the edges belonging to E(K4 \

Edge-decompositions of Kn,n into isomorp
Edge-decompositions of Kn,n into isomorphic copies of a given tree
✍ Anna Lladó; S.C. López 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

We study the Ha ¨ggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph K n;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of K n;n . Whe

A covering construction for packing disj
A covering construction for packing disjoint copies of the Hoffman-Singleton graph into K50
✍ Jana Ŝiagiová; Mariusz Meszka 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into __K__~50~. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience (www.interscience

Partitioning the edge set of a bipartite
Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
✍ D. de Werra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 154 KB

An extension of the decomposition theorem of Birkhoff-von Neumann theorem is given for the case where entries can be positive or negative. The special case of an integral matrix is discussed and some balancing properties which are trivial for the classical case (non-negative entries only in the matr