Counting deranged matchings

DOI10.1016/J.EJC.2024.103980zbMATH Open1543.05088MaRDI QIDQ6568854

[[Person:6062873|Author name not available (Why is that?)]], Sam Spiro

Publication date: 8 July 2024

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of graphs with a heavy-tailed degree sequence
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Dinner, Dancing, and Tennis, Anyone?
• Avoiding Your Spouse at a Bridge Party
• Asymptotic Enumeration ofk-Edge-Coloredk-Regular Graphs
• Asymptotic enumeration of Latin rectangles
• Random perfect matchings in regular graphs

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)