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 Kn,n with a disjoint perfect matching M removed. Likewise, a deranged matching is a perfect matching in the complete graph K2n minus a perfect matching M. With mathrmpm(cdot) counting perfect matchings, the elder phenomenon takes the form mathrmpm(Kn,nM)/mathrmpm(Kn,n)o1/e as noinfty while its youthful analogue is mathrmpm(K2nM)/mathrmpm(K2n)o1/sqrte. These starting graphs are both 2n-vertex `balanced complete r-partite' graphs Krimes2n/r, respectively with r=2 and r=2n. We conjecture that mathrmpm(Krimes2n/rM)/mathrmpm(Krimes2n/r)simer/(2r2) as noinfty and establish several substantive special cases thereof. For just two examples, r=3 yields the limit e3/4 while r=n results again in e1/2. Our tools blend combinatorics and analysis in a medley incorporating Inclusion-Exclusion and Tannery's Theorem.



Cites work








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)