Good sequencings for small Mendelsohn triple systems

From MaRDI portal
Publication:6325278

arXiv1909.06475MaRDI QIDQ6325278FDOQ6325278


Authors: Donald L. Kreher, D. R. Stinson, Shannon Veitch Edit this on Wikidata


Publication date: 13 September 2019

Abstract: A Mendelsohn triple system of order v (or MTS(v)) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges (x,y), (y,z) and (z,x) by (x,y,z), (y,z,x) or (z,x,y). An ell-good sequencing of a MTS(v) is a permutation of the points of the design, say [x1;cdots;xv], such that, for every triple (x,y,z) in the design, it is not the case that x=xi, y=xj and z=xk with i<j<k and ki+1leqell; or with j<k<i and ij+1leqell; or with k<i<j and jk+1leqell.













This page was built for publication: Good sequencings for small Mendelsohn triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325278)