Counting Multiple Cyclic Choices Without Adjacencies

DOI10.4153/CMB-2005-022-4MaRDI QIDQ5316118zbMATH OpenOpenAlexFDO

Authors

Publication date 12 September 2005

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-2005-022-4

zbMATH Keywords

inclusion-exclusionproblème des ménages

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• Cycle multiplicity of some total graphs
• Counting permutations by the number of successions within cycles
• scientific article; zbMATH DE number 7310089
• Counting non-isomorphic maximal independent sets of the n-cycle graph
• Counting \(r\)-graphs without forbidden configurations
• Counting maximal cycles in binary matroids
• Counting combinatorial choice rules
• Counting permutations by numbers of excedances, fixed points and cycles
• Counting pure \(k\)-cycles in sequences of Cayley graphs

Cited in

(3)

• A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization
• Multinomial permutations on a circle
• scientific article; zbMATH DE number 806865 (Why is no real title available?)

This page was built for publication: Counting Multiple Cyclic Choices Without Adjacencies

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