Resolvable tree designs
A graph \(G\) has an \(H\)-factorization \((H| G)\) if the edges of \(G\) can be partitioned into \(H\)-factors (an \(H\)-factor is a spanning subgraph each component of which is isomorphic to \(H\)). Let \(K_ n\) denote the complete graph of order \(n\) where each edge has multiplicity \(\lambda\) and \(T_ k\) be a tree with \(k\) vertices. Main results are \[ \text{If } T_ k| K_ k\text{ then } T_ k|\lambda K_ n\text{ iff } n\equiv 0\pmod k\text{ and } \lambda k(n-1)\equiv 0\pmod{2(k-1)}. \tag{1} \] \[ \text{If } T_ k| 2K_ k\text{ then }T_ k| 2\lambda K_ n\text{ iff } n\equiv 0\pmod k \text{ and }\lambda k(n-1)\equiv 0\pmod{k-1}. \tag{2} \] {}.
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Decomposition of complete multigraphs into stars
- Existence of resolvable path designs
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 7225155 (Why is no real title available?)
- On resolvable tree-decompositions of complete graphs
- Resolvable path designs
- Isomorphic factorizations VIII: Bisectable trees
- Factorizations of \(K_{m,n}\) into spanning trees
- Semirotational tree factorizations of complete graphs
- Nonexistence of some T-factorizations of order 12
- scientific article; zbMATH DE number 4033791 (Why is no real title available?)
- scientific article; zbMATH DE number 4110737 (Why is no real title available?)
- scientific article; zbMATH DE number 68334 (Why is no real title available?)
- scientific article; zbMATH DE number 2068171 (Why is no real title available?)
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
- Existence of resolvable path designs
This page was built for publication: Resolvable tree designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200005)
