Packing arborescences in random digraphs

TL;DR

This paper investigates the maximum number of arc-disjoint arborescences in a random directed graph, providing precise estimates depending on the edge probability, and establishes that this maximum equals a specific combinatorial parameter almost surely.

Contribution

It introduces a new characterization of the maximum packing of arborescences in random digraphs and derives tight estimates for this quantity based on the edge probability.

Findings

Maximum number of arc-disjoint arborescences equals a combinatorial parameter λ.

Provides tight estimates for λ depending on p.

Establishes almost sure equality between maximum packing and λ.

Abstract

We study the problem of packing arborescences in the random digraph $\mathcal D(n,p)$, where each possible arc is included uniformly at random with probability $p=p(n)$. Let $\lambda(\mathcal D(n,p))$ denote the largest integer $\lambda\geq 0$ such that, for all $0\leq \ell\leq \lambda$, we have $\sum_{i=0}^{\ell-1} (\ell-i)|\{v: d^{in}(v) = i\}| \leq \ell$. We show that the maximum number of arc-disjoint arborescences in $\mathcal D(n,p)$ is $\lambda(\mathcal D(n,p))$ a.a.s. We also give tight estimates for $\lambda(\mathcal D(n,p))$ depending on the range of $p$.