Pages that link to "Item:Q1235702"
From MaRDI portal
The following pages link to On the maximum number of permutations with given maximal or minimal distance (Q1235702):
Displaying 50 items.
- 3-setwise intersecting families of the symmetric group (Q2032892) (← links)
- On the intersection density of primitive groups of degree a product of two odd primes (Q2102702) (← links)
- Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields (Q2120915) (← links)
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations (Q2133641) (← links)
- On maximum intersecting sets in direct and wreath product of groups (Q2136206) (← links)
- On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups (Q2143623) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Intersection theorems for triangles (Q2172651) (← links)
- Graphical designs and extremal combinatorics (Q2197221) (← links)
- New bounds on even cycle creating Hamiltonian paths using expander graphs (Q2220967) (← links)
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations (Q2236813) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- On \(r\)-cross \(t\)-intersecting families for weak compositions (Q2339425) (← links)
- A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
- Permutation codes invariant under isometries (Q2345924) (← links)
- The maximum product of sizes of cross-intersecting families (Q2359973) (← links)
- Erdős-Ko-Rado for perfect matchings (Q2400976) (← links)
- Maximum size of a family of pairwise graph-different permutations (Q2411509) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← links)
- Theorems of Erdős-Ko-Rado type in geometrical settings (Q2438531) (← links)
- Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- Forbidding just one intersection, for permutations (Q2452427) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- On Rosenbloom and Tsfasman's generalization of the Hamming space (Q2455578) (← links)
- Maximum stable sets in analogs of Kneser and complete graphs (Q2519792) (← links)
- Approximation by juntas in the symmetric group, and forbidden intersection problems (Q2671454) (← links)
- Permutations that separate close elements (Q2689006) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs (Q2875531) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- ON THE PARTIAL DIFFERENCE SETS IN CAYLEY DERANGEMENT GRAPHS (Q3388606) (← links)
- Independent sets of maximal size in tensor powers of vertex-transitive graphs (Q3633011) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- Constructions of permutation arrays for certain scheduling cost measures (Q4322473) (← links)
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY (Q4635501) (← links)
- Sharply triply transitive projective permutation groups and nonbinary codes generated by them (Q4745751) (← links)
- One point stabilizers in almost simple sharp permutation groups (Q4953311) (← links)
- On the Erdos-Ko-Rado property of finite groups of order a product of three primes (Q5009931) (← links)
- On complete multipartite derangement graphs (Q5013345) (← links)
- Some Erdös-Ko-Rado results for linear and affine groups of degree two (Q5058166) (← links)
- (Q5164966) (← links)
- On $k$-Neighbor Separated Permutations (Q5234659) (← links)
- Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications (Q5249059) (← links)
- Intersecting families in classical Coxeter groups (Q5397398) (← links)
- Anzahl theorems in geometry of<i>t</i>-singular classical groups and their applications (Q5741232) (← links)
- On Disjoint Cross Intersecting Families of Permutations (Q5884265) (← links)
