On embedding incomplete symmetric Latin squares

Cites Work

Embedding Incomplete Latin Squares
Embedding an incomplete diagonal latin square in a complete diagonal latin square
A Combinatorial Theorem with an Application to Latin Rectangles
Systems of Distinct Representatives
Finite embedding theorems for partial Latin squares, quasi-groups, and loops

Cited In (36)

Intersection preserving finite embedding theorems for partial quasigroups
A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
Edge domination in complete partite graphs
On completing partial Latin squares with prescribed diagonals
The fine structures of three symmetric Latin squares with even orders
Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
Embedding an incomplete latin square in a latin square with a prescribed diagonal
Embedding connected factorizations
On the number of 1-factorizations of the complete graph
Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
Intersection problem of Steiner systems S(3,4,2v)
A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
Amalgamated Factorizations of Complete Graphs
A number-theoretic function related to Latin squares
Coloring Block Designs is NP-Complete
On regular set systems containing regular subsystems
Generalized latin rectangles. II: Embedding
The tournament scheduling problem with absences
Strong finite embeddability for classes of quasigroups
Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
Small embeddings for partial cycle systems of odd length
Toward a three-dimensional counterpart of Cruse's theorem
Outline symmetric Latin squares
Existence of generalized Latin squares which are not embeddable in any group
Coloring Steiner Triple Systems
Completing incomplete commutative Latin squares with prescribed diagonals
Steiner quadruple systems having a prescribed number of quadruples in common
Embedding partial Steiner triple systems is NP-complete
On the number of conjugates of a quasigroup
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
On the completion of latin rectangles to symmetric latin squares
Recoloring subgraphs of \(K_{2n}\) for sports scheduling
The finite embeddability property for IP loops and local embeddability of groups into finite IP loops
Hamiltonian double Latin squares
Almost regular edge colorings and regular decompositions of complete graphs

This page was built for publication: On embedding incomplete symmetric Latin squares

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