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

Summary: A permutation in a digraph \(G=(V, E)\) is a bijection \(f:V \rightarrow V\) such that for all \(v \in V\) we either have that \(f\) fixes \(v\) or \((v, f(v)) \in E\). A derangement in \(G\) is a permutation that does not fix any vertex. \textit{M. Bucic} et al. [``Perfect matchings and derangements on graphs'', J. Graph Theory 97, No. 2, 340--354 (2021; \url{doi:10.1002/jgt.22658})] proved that in any digraph, the ratio of derangements to permutations is at most \(1/2\). Answering a question posed by Bucic et al. [loc. cit.], we show that the set of possible ratios of derangements to permutations in digraphs is dense in the interval \([0, 1/2]\).