On the maximum number of permutations with given maximal or minimal distance
From MaRDI portal
Publication:1235702
DOI10.1016/0097-3165(77)90009-7zbMath0352.05003OpenAlexW2041807026MaRDI QIDQ1235702
Peter Frankl, Michel Marie Deza
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(77)90009-7
Related Items
Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields, The maximum product of sizes of cross-intersecting families, Structure of independent sets in direct products of some vertex-transitive graphs, On Disjoint Cross Intersecting Families of Permutations, Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations, On maximum intersecting sets in direct and wreath product of groups, On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups, Some Erdös-Ko-Rado results for linear and affine groups of degree two, A random construction for permutation codes and the covering radius, Sharp sets of permutations, The maximum clique problem for permutation Hamming graphs, Permutation codes with specified packing radius, Erdős-Ko-Rado for perfect matchings, Intersection theorems for triangles, Tree representations of graphs, New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric, Maximum size of a family of pairwise graph-different permutations, An analogue of the Erdős-Ko-Rado theorem for weak compositions, Approximation by juntas in the symmetric group, and forbidden intersection problems, Stability for \(t\)-intersecting families of permutations, A new metric on symmetric groups and applications to block permutation codes, New nonexistence results on perfect permutation codes under the Hamming metric, Cross-intersecting families and primitivity of symmetric systems, Structure and supersaturation for intersecting families, An Erdős-Ko-Rado theorem for permutations with fixed number of cycles, Helly-type theorems about sets, On the Erdős-Ko-Rado property for finite groups, A non-trivial intersection theorem for permutations with fixed number of cycles, Graphical designs and extremal combinatorics, Stability for intersecting families in \(\mathrm{PGL}(2,q)\), Theorems of Erdős-Ko-Rado type in geometrical settings, Erdős-Ko-Rado theorems in certain semilattices, An Erdős-Ko-Rado-type theorem in Coxeter groups., Semidefinite programming for permutation codes, New bounds on even cycle creating Hamiltonian paths using expander graphs, Forbidding just one intersection, for permutations, Setwise intersecting families in classical Coxeter groups, Diagonally neighbour transitive codes and frequency permutation arrays, On Rosenbloom and Tsfasman's generalization of the Hamming space, LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY, Intersecting families in classical Coxeter groups, Erdős-Ko-Rado theorems for permutations and set partitions, The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations, Constructing permutation arrays from groups, Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\), Triangle-different Hamiltonian paths, A quasi-stability result for dictatorships in \(S_n\), Extending permutation arrays: improving MOLS bounds, Intersecting families of permutations, Coding with injections, Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups, Some intersection theorems for structures, Some intersection theorems for structures, Eigenvalues of the derangement graph, Cross-intersecting families of permutations, Some Erdős-Ko-Rado theorems for injections, Permutation codes, Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices, Anzahl theorems in geometry oft-singular classical groups and their applications, A new nonexistence result for sharply multiply transitive permutation sets., Erdös–Ko–Rado Theorem—22 Years Later, Intersecting families of permutations, Bounds on permutation codes of distance four, On permutation groups of finite type, Covering radius for sets of permutations, Compression and Erdős-Ko-Rado graphs, On the chromatic number of a simplicial complex, An exact result for \((0, \pm 1)\)-vectors, 3-setwise intersecting families of the symmetric group, One point stabilizers in almost simple sharp permutation groups, A lower bound on permutation codes of distance \(n-1\), Bounds for permutation arrays, A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations, Maximum stable sets in analogs of Kneser and complete graphs, Strongly intersecting integer partitions, Independent sets of maximal size in tensor powers of vertex-transitive graphs, ON THE PARTIAL DIFFERENCE SETS IN CAYLEY DERANGEMENT GRAPHS, Fundamentals of coding type problems, On \(t\)-intersecting families of signed sets and permutations, Special sequences as subcodes of Reed-Solomon codes, Frankl-Rödl-type theorems for codes and permutations, Setwise intersecting families of permutations, A new table of permutation codes, On $k$-Neighbor Separated Permutations, Stable sets of maximal size in Kneser-type graphs, A note on good permutation codes from Reed-Solomon codes, New lower bounds for permutation arrays using contraction, The Erdős-Ko-Rado properties of various graphs containing singletons, Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications, Sharply triply transitive projective permutation groups and nonbinary codes generated by them, On the Erdos-Ko-Rado property of finite groups of order a product of three primes, On \(r\)-cross \(t\)-intersecting families for weak compositions, A Deza-Frankl type theorem for set partitions, On complete multipartite derangement graphs, On the intersection density of primitive groups of degree a product of two odd primes, Unnamed Item, Permutation codes invariant under isometries, Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs, An Erdős--Ko--Rado theorem for partial permutations, Multiple contractions of permutation arrays, Intersection theorems for finite general linear groups, KKL's influence on me
Cites Work
