Abstract
A permutation in a digraph is a bijection such that for all we either have that fixes or . A derangement in is a permutation that does not fix any vertex. In [1] it is proved that in any digraph, the ratio of derangements to permutations is at most . Answering a question posed in [1], we show that the set of possible ratios of derangements to permutations in digraphs is dense in the interval .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.