Pages that link to "Item:Q1779486"

The following pages link to Covering radius for sets of permutations (Q1779486):

Displaying 21 items.

• On the maximum number of Latin transversals (Q272327) (← links)
• Permutation codes with specified packing radius (Q356723) (← links)
• Remoteness of permutation codes (Q427818) (← links)
• On rainbow matchings in bipartite graphs (Q510529) (← links)
• The number of transversals in a Latin square (Q851756) (← links)
• A random construction for permutation codes and the covering radius (Q851770) (← links)
• Permutation codes (Q966159) (← links)
• The covering radius of \(\mathrm{PGL}(3, q)\) (Q1712509) (← links)
• The covering radii of the 2-transitive unitary, Suzuki, and Ree groups (Q1755292) (← links)
• Covering radius in the Hamming permutation space (Q2011145) (← links)
• The covering radius of \(\mathrm{PGL}_2(q)\) (Q2012535) (← links)
• The multicovering radius problem for some types of discrete structures (Q2248636) (← links)
• Covering radius of permutation groups with infinity-norm (Q2297719) (← links)
• The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
• Topological methods for the existence of a rainbow matching (Q2413401) (← links)
• Semidefinite programming for permutation codes (Q2449151) (← links)
• Transversals of Latin squares and covering radius of sets of permutations (Q2509702) (← links)
• The covering radius of permutation designs (Q2688257) (← links)
• Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← links)
• (Q5122710) (← links)
• All group‐based latin squares possess near transversals (Q6187426) (← links)