Approximate Itai-Zehavi conjecture for random graphs

TL;DR

This paper demonstrates that the Itai-Zehavi conjecture holds asymptotically for certain classes of random graphs, confirming its validity in probabilistic models with high connectivity.

Contribution

It provides the first asymptotic proof of the Itai-Zehavi conjecture for Erdős-Rényi and random regular graphs under specific conditions, using sprinkling techniques.

Findings

Conjecture holds asymptotically for Erdős-Rényi graphs with high average degree.

Conjecture holds asymptotically for random regular graphs with high degree.

Confirmed the conjecture up to a constant factor for sparser random regular graphs.

Abstract

A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ when $np= \omega(\log n)$ and for random regular graphs $G(n,d)$ when $d= \omega(\log n)$. Moreover, we essentially confirm the conjecture up to a constant factor for sparser random regular graphs. This answers positively a question of Dragani\'{c} and Krivelevich. Our proof makes use of recent developments on sprinkling techniques in random regular graphs.