The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)

DOI10.37236/10293zbMath1481.05061arXiv2101.02995OpenAlexW3119228984MaRDI QIDQ2073299

Bethany Austhof, Patrick Bennett, Nick Christo

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.02995

zbMATH Keywords

number of permutationsratios of derangements

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Deranged Matchings: Proofs and Conjectures

Cites Work

• Introduction to Random Graphs
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Perfect matchings and derangements on graphs

This page was built for publication: The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)