Pages that link to "Item:Q1235702"

The following pages link to On the maximum number of permutations with given maximal or minimal distance (Q1235702):

Displaying 50 items.

• The estimate of the number of permutationally-ordered sets (Q253952) (← links)
• Structure of independent sets in direct products of some vertex-transitive graphs (Q270290) (← links)
• Permutation codes with specified packing radius (Q356723) (← links)
• Remark on one problem in extremal combinatorics (Q376113) (← links)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
• A quasi-stability result for dictatorships in \(S_n\) (Q519995) (← links)
• Extending permutation arrays: improving MOLS bounds (Q521869) (← links)
• Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
• Stability for \(t\)-intersecting families of permutations (Q616451) (← links)
• Cross-intersecting families and primitivity of symmetric systems (Q618301) (← links)
• Triangle-different Hamiltonian paths (Q684117) (← links)
• Coding with injections (Q690670) (← links)
• A new nonexistence result for sharply multiply transitive permutation sets. (Q704296) (← links)
• On the chromatic number of a simplicial complex (Q722323) (← links)
• An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
• Strongly intersecting integer partitions (Q740661) (← links)
• Special sequences as subcodes of Reed-Solomon codes (Q764087) (← links)
• Setwise intersecting families of permutations (Q765866) (← links)
• A new table of permutation codes (Q766240) (← links)
• A class of maximal permutation cliques (Q793037) (← links)
• An Erdős--Ko--Rado theorem for partial permutations (Q817754) (← links)
• A random construction for permutation codes and the covering radius (Q851770) (← links)
• Tree representations of graphs (Q875046) (← links)
• On the Erdős-Ko-Rado property for finite groups (Q894241) (← links)
• A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
• Stability for intersecting families in \(\mathrm{PGL}(2,q)\) (Q907232) (← links)
• An Erdős-Ko-Rado-type theorem in Coxeter groups. (Q925012) (← links)
• Erdős-Ko-Rado theorems for permutations and set partitions (Q941314) (← links)
• Eigenvalues of the derangement graph (Q965212) (← links)
• Cross-intersecting families of permutations (Q965227) (← links)
• Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
• Permutation codes (Q966159) (← links)
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations (Q1003591) (← links)
• On \(t\)-intersecting families of signed sets and permutations (Q1025955) (← links)
• The Erdős-Ko-Rado properties of various graphs containing singletons (Q1043643) (← links)
• Sharp sets of permutations (Q1105023) (← links)
• Extremal problems on permutations under cyclic equivalence (Q1109772) (← links)
• Helly-type theorems about sets (Q1140667) (← links)
• Bounds for permutation arrays (Q1248524) (← links)
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
• Setwise intersecting families in classical Coxeter groups (Q1727798) (← links)
• Constructing permutation arrays from groups (Q1744019) (← links)
• Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\) (Q1747780) (← links)
• Largest minimal inversion-complete and pair-complete sets of permutations (Q1747991) (← links)
• Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups (Q1758575) (← links)
• Covering radius for sets of permutations (Q1779486) (← links)
• Compression and Erdős-Ko-Rado graphs (Q1779494) (← links)
• Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
• Covering radius in the Hamming permutation space (Q2011145) (← links)