Pages that link to "Item:Q2264673"

The following pages link to On embedding incomplete symmetric Latin squares (Q2264673):

Displaying 34 items.

• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations (Q289992) (← links)
• The tournament scheduling problem with absences (Q323410) (← links)
• The fine structures of three symmetric Latin squares with even orders (Q546366) (← links)
• A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\) (Q686159) (← links)
• Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice (Q713155) (← links)
• Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
• Embedding an incomplete latin square in a latin square with a prescribed diagonal (Q796539) (← links)
• Completing incomplete commutative Latin squares with prescribed diagonals (Q1050344) (← links)
• Steiner quadruple systems having a prescribed number of quadruples in common (Q1071773) (← links)
• Intersection problem of Steiner systems S(3,4,2v) (Q1097890) (← links)
• Generalized latin rectangles. II: Embedding (Q1160182) (← links)
• Outline symmetric Latin squares (Q1183972) (← links)
• On the number of 1-factorizations of the complete graph (Q1212021) (← links)
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 (Q1216305) (← links)
• A number-theoretic function related to Latin squares (Q1220935) (← links)
• Strong finite embeddability for classes of quasigroups (Q1224123) (← links)
• On the number of conjugates of a quasigroup (Q1224662) (← links)
• Intersection preserving finite embedding theorems for partial quasigroups (Q1241819) (← links)
• Edge domination in complete partite graphs (Q1336647) (← links)
• Hamiltonian double Latin squares (Q1403912) (← links)
• Existence of generalized Latin squares which are not embeddable in any group (Q1705831) (← links)
• On regular set systems containing regular subsystems (Q1979429) (← links)
• Recoloring subgraphs of \(K_{2n}\) for sports scheduling (Q2034794) (← links)
• Embedding connected factorizations (Q2131871) (← links)
• On completing partial Latin squares with prescribed diagonals (Q2170804) (← links)
• Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs (Q2223450) (← links)
• Small embeddings for partial cycle systems of odd length (Q2639071) (← links)
• Almost regular edge colorings and regular decompositions of complete graphs (Q3614746) (← links)
• Coloring Block Designs is NP-Complete (Q3960717) (← links)
• Coloring Steiner Triple Systems (Q3966168) (← links)
• Amalgamated Factorizations of Complete Graphs (Q4305317) (← links)
• The finite embeddability property for IP loops and local embeddability of groups into finite IP loops (Q5217092) (← links)
• Toward a three-dimensional counterpart of Cruse's theorem (Q6490371) (← links)