Embedding partial Mendelsohn triple systems
From MaRDI portal
It is proved that a partial Mendelsohn triple system on m symbols can be embedded in a Mendelsohn triple system to t symbols for all admissible \(t\geq 4m\), where if t is even then \(m\geq 14\).
Recommendations
Cites work
- A Solution to the Embedding Problem for Partial Idempotent Latin Squares
- Embedding Partial Steiner Triple Systems
- Finite partial cyclic triple systems can be finitely embedded
- Graph theory
- scientific article; zbMATH DE number 3831949 (Why is no real title available?)
- scientific article; zbMATH DE number 3378938 (Why is no real title available?)
- Small Embeddings for Partial Semisymmetric and Totally Symmetric Quasigroups
- Small Embeddings of Incomplete Idempotent Latin Squares
- Thank Evans!
- The Solution of a Timetabling Problem
Cited in
(13)- Embedding extended Mendelsohn triple systems
- Homogeneous embeddings of disjoint Mendelsohn triple systems
- Embeddings of resolvable triple systems
- The module theory of semisymmetric quasigroups, totally symmetric quasigroups, and triple systems
- scientific article; zbMATH DE number 3849245 (Why is no real title available?)
- scientific article; zbMATH DE number 3918375 (Why is no real title available?)
- scientific article; zbMATH DE number 4039919 (Why is no real title available?)
- Small embeddings of partial directed cycle systems
- On the embeddings of mendelsohn triple systems
- Embeddings of resolvable mendelsohn triple systems
- Embeddings of pure mendelsohn triple systems and pure directed triple systems
- Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
- A partial m=(2k+1)-cycle system of order n can be embedded in an m- cycle of order (2n+1)m
This page was built for publication: Embedding partial Mendelsohn triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114692)