Counting deranged matchings

DOI10.1016/J.EJC.2024.103980MaRDI QIDQ6568854zbMATH OpenFDO

Authors Sam Spiro

Publication date 8 July 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.103980

zbMATH Keywords

counting the number of derangements on \(n\) lettersnumber of perfect matchings of a graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matchings and derangements on graphs
• Perfect matchings in \(\varepsilon\)-regular graphs
• Alternating sign property of the perfect matching derangement graph
• Almost fair perfect matchings in complete bipartite graphs
• Random perfect matchings in regular graphs

Cites work

• scientific article; zbMATH DE number 3708282 (Why is no real title available?)
• scientific article; zbMATH DE number 3748105 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration of Latin rectangles
• Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
• Avoiding Your Spouse at a Bridge Party
• Combinatorial estimates by the switching method
• Dinner, Dancing, and Tennis, Anyone?
• Enumeration of graphs with a heavy-tailed degree sequence
• Random perfect matchings in regular graphs
• Subgraphs of random graphs with specified degrees

Cited in

(2)

• Deranged Matchings: Proofs and Conjectures
• Deranged perfect matchings on complete graph and balanced complete r-partite graph

This page was built for publication: Counting deranged matchings

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