• Corpus ID: 18581981

Down-linking $(K_v,\Gamma)$-designs to $P_3$-designs

  title={Down-linking \$(K\_v,\Gamma)\$-designs to \$P\_3\$-designs},
  author={Anna Benini and Luca Giuzzi and Anita Pasotti},
  journal={arXiv: Combinatorics},
Let G' be a subgraph of a graph G. We define a down-link from a (K_v,G)-design B to a (K_n,G')-design B' as a map f:B->B' mapping any block of B into one of its subgraphs. This is a new concept, closely related with both the notion of metamorphosis and that of embedding. In the present paper we study down-links in general and prove that any (K_v,G)-design might be down-linked to a (K_n,G')-design, provided that n is admissible and large enough. We also show that if G'=P_3, it is always possible… 
1 Citations

New results on path-decompositions and their down-links

The spectrum problems for œ = P4 are studied and general results on the existence of path-decompositions and embeddings between pathdecomposition playing a fundamental role for the construction of down-links are presented.



Sampling complete designs

Embedding path designs into kite systems

Embedding balanced P3-designs into (balanced) P4-designs

Embedding handcuffed designs in D-designs, where D is the triangle with attached edge

The metamorphosis of l-fold block designs with block size four into l-fold 4-cycle systems

Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from each block of B the resulting collection of kites K is a partial lambda-fold kite system (X, K). If

Two generalizations of the metamorphosis definition

Let B(k, λ) be the spectrum of integers n such that there exists a Sλ(2, k, n), a balanced incomplete block design of order n, block size k and index λ. Lindner and Rosa [6] introduced the definition

Constructions and Uses of Pairwise Balanced Designs

A pairwise balanced design (PBD) of index unity is a pair (X,A) where X is a set (of points) and A a class of subsets A of X (called blocks) such that any pair of distinct points of X is contained in

Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1

Abstract A general embedding technique for graph designs and block designs is developed, which transforms the embedding problem for partial designs with ƛ > 1 into the embedding problem for partial

Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems

Existence of cyclic k-cycle systems of the complete graph