Ménage numbers, bijections and P-recursiveness

DOI10.1016/0012-365X(87)90002-1zbMath0617.05003OpenAlexW2025532738MaRDI QIDQ1821781

E. Rodney Canfield, Nicholas C. Wormald

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90002-1

zbMATH Keywords

permutationsrecurrenceP-recursiveménage number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

The log-behavior of ménage numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differentiably finite power series
• Sister Celine's technique and its generalizations
• The Hammond Series of a Symmetric Function and Its Application to P-Recursiveness
• The Algebra of Linear Partial Difference Operators and Its Applications
• Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
• Number of labeled 4-regular graphs
• Permanents of cyclic (0,1) matrices
• The Enumeration of Locally Restricted Graphs (II)
• Some Unusual Enumeration Problems

This page was built for publication: Ménage numbers, bijections and P-recursiveness