The solution to the complete nontrivial cycle intersection problem for permutations

DOI10.1007/978-3-031-82014-4_6MaRDI QIDQ6973080zbMATH OpenFDO

Authors Vladimir Blinovsky, L. D. Sperança

Publication date 11 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-82014-4_6

zbMATH Keywords

cycle intersectionnontrivial intersection

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• An analogue of the Hilton-Milner theorem for set partitions
• Erdős-Ko-Rado theorems for permutations and set partitions
• Intersecting families of permutations
• Lectures on advances in combinatorics
• On intersecting families of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Stable sets of maximal size in Kneser-type graphs
• The complete intersection theorem for systems of finite sets
• The complete nontrivial-intersection theorem for systems of finite sets

This page was built for publication: The solution to the complete nontrivial cycle intersection problem for permutations

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