Steven Finch

collaborators

2 papers

math.CO2025

Large Components and Trees of Random Mappings

Ljuben Mutafchiev, Steven Finch

Let $T_{n}$ be the set of all mappings $T : [n] \to [n]$ , where $[n] = {1, 2, \dots, n}$ . The corresponding graph $G_{T}$ of $T$ , called a functional digraph, is a union of disjoin…

math.CO2023

On the Deepest Cycle of a Random Mapping

Ljuben Mutafchiev, Steven Finch

Let $T_{n}$ be the set of all mappings $T : {1, 2, \dots, n} \to {1, 2, \dots, n}$ . The corresponding graph of $T$ is a union of disjoint connected unicyclic components. We ass…