Resolvable perfect Mendelsohn designs with block size five
A \((v,k,\lambda)\)-Mendelsohn design (MD) is, using graph-theoretic notation, a decomposition of the complete directed multigraph \(\lambda\text{DK}_v\) on \(v\) vertices into \(k\)-circuits. A perfect Mendelsohn design has the additional property that for any \(r\), \(1 \leq r \leq k-1\), and for any two distinct vertices \(x\) and \(y\), there are exactly \(\lambda\) of the \(k\)-circuits along which the (directed) distance from \(x\) to \(y\) is \(r\). A Mendelsohn design is said to be resolvable if the \(k\)-circuits can be partitioned into sets of \(k\)-circuits that in turn partition the vertex set. A resolvable perfect \((v,k,\lambda)\)-MD is called a \((v,k,\lambda)\)-RPMD. It is shown that the necessary condition for the existence of a \((v,5,1)\)-RPMD, namely that \(v\) is divisible by 5, is sufficient except for \(v \in \{5,10\}\) and with the 17 cases \(v \in \{20,30,90,95,100,110,115,120,130,135,140,150,160,170,190,195,210\}\) unresolved.
- Almost resolvable perfect Mendelsohn designs with block size five
- Resolvable Mendelsohn designs with block size 4
- Perfect Mendelsohn packing designs with block size five
- Resolvable balanced incomplete block designs with block size 5
- Perfect Mendelsohn designs with block size six
- Perfect Mendelsohn designs with block size six
- scientific article; zbMATH DE number 4181350
- Perfect Mendelsohn designs with equal-sized holes and block size four
- Resolvable Designs With Unequal Block Sizes
- Existence of \(r\)-fold perfect \((v,K,1)\)-Mendelsohn designs with \(K\subseteq \{4,5,6,7\}\)
- Resolvable path designs
- Constructions of perfect Mendelsohn designs
- Existence of 4-fold perfect \((v, \{5, 8\}, 1)\)-Mendelsohn designs
- scientific article; zbMATH DE number 2186986 (Why is no real title available?)
- The existence of resolvable Mendelsohn design \(RMD(\{4,s^*\},v)\)
- Resolvable Mendelsohn designs and finite Frobenius groups
- Existence of 5-fold perfect \((v,\{6,7\},1)\)-Mendelsohn designs
- Almost resolvable perfect Mendelsohn designs with block size five
- Completing the solution of the directed Oberwolfach problem with cycles of equal length
- A survey on constructive methods for the Oberwolfach problem and its variants
- Completing the solution of the directed Oberwolfach problem with two tables
- On the directed Hamilton-Waterloo problem with two cycle sizes
- The directed uniform Hamilton-Waterloo problem involving even cycle sizes
This page was built for publication: Resolvable perfect Mendelsohn designs with block size five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598786)
