Deranged Matchings: Proofs and Conjectures
From MaRDI portal
Publication:6189652
Abstract: We introduce, and partially resolve, a conjecture that brings a three-centuries-old derangements phenomenon and its much younger two-decades-old analogue under the same umbrella. Through a graph-theoretic lens, a derangement is a perfect matching in the complete bipartite graph with a disjoint perfect matching removed. Likewise, a deranged matching is a perfect matching in the complete graph minus a perfect matching . With counting perfect matchings, the elder phenomenon takes the form as while its youthful analogue is . These starting graphs are both -vertex `balanced complete -partite' graphs , respectively with and . We conjecture that as and establish several substantive special cases thereof. For just two examples, yields the limit while results again in . Our tools blend combinatorics and analysis in a medley incorporating Inclusion-Exclusion and Tannery's Theorem.
Recommendations
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3769673 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3636998 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 7203208 (Why is no real title available?)
- A new proof of an integral formula for counting perfect matchings in graphs
- A vector space analog of permutations with restricted position
- Amazing and aesthetic aspects of analysis
- Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings
- Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
- Avoiding Your Spouse at a Bridge Party
- Complementary matching vectors and the uniform matching extension property
- Deranged Matchings: Enumeration by Integration!!
- Derangements, Permanents, and Christmas Presents
- Dinner, Dancing, and Tennis, Anyone?
- Graph theory
- Hermite polynomials and a duality relation for matchings polynomials
- Integrals don't have anything to do with discrete math, do they?
- Matchings, Derangements, Rencontres
- Perfect matchings and derangements on graphs
- Recontres Reencountered
- Roots of polynomials and the derangement problem
- The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
This page was built for publication: Deranged Matchings: Proofs and Conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6189652)