Remark on one problem in extremal combinatorics

DOI10.1134/S0032946012010073zbMATH Open1275.05002MaRDI QIDQ376113FDOQ376113

Authors: Vladimir Blinovsky 

Publication date: 4 November 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• Erdős-Ko-Rado theorems for permutations and set partitions
• On the maximum number of permutations with given maximal or minimal distance
• Forbidding just one intersection, for permutations
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles

zbMATH Keywords

common fixed pointscommontranspositionsmaximum number of permutations of a finite set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal combinatorics (05D99)

Cites Work

• Intersecting families of permutations
• Intersection theorem for finite permutations

Cited In (1)

• On the maximum number of permutations with given maximal or minimal distance

This page was built for publication: Remark on one problem in extremal combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376113)