This paper surveys some recent results and new techniques concerning edge-disjoint
decompositions of K n into copies of G, where G may be a cycle, a path, or just a small …

AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. We survey the current state of knowledge on the …

All graphs considered are finite, undirected, with no loops and no multiple edges. A graph H
is said to have a G-decomposition if it is the union of pairwise edge-disjoint subgraphs each …

The graph decomposition problem is well known. We say a subgraph G divides K m if the
edges of K m can be partitioned into copies of G. Such a partition is called a G …

We prove that a graph of edge-connectivity at least 10^10^10^14 has an edge-
decomposition into paths of length 4 if and only its size is divisible by 4. We also prove that a …

In this paper we consider the problem of determining all values of v for which there exists a
decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies …

In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack
low rate signals into higher rate streams to share a wavelength. The grooming chosen …

Abstract A kite\(K\) is a graph which can be obtained by joining an edge to any vertex
of\(K_3\). A kite with edge set\(\{ab,\, bc,\, ca,\, cd\}\) can be denoted as\((a,\, b,\, c;\, cd)\). If …

In this paper, we introduce the concept of the fine triangle intersection problem for a pair of G-
designs, and we consider this problem for kite systems. Let Fin (v)={(s, t):∃ a pair of kite …

The Doyen–Wilson theorem for kite systems - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …