Mathematicians just proved that 'busy' networks are physically forced to have a specific number of loop-back paths.
April 17, 2026
Original Paper
Openly disjoint cycles through a vertex in regular digraphs
arXiv · 2604.13700
The Takeaway
In network theory, we've long wondered if a highly connected system—like a brain or a power grid—guarantees a certain number of ways to get back to where you started without retracing your steps. This paper solves Mader's conjecture, a riddle that has stumped graph theorists for decades. It proves that in a 'regular' network where every point has the same number of connections (r), the number of these independent loop-back paths is at least 3/22 of those connections. This wasn't obvious because in messy, non-regular networks, these paths can easily be blocked or non-existent. By proving this linear growth, we now have a mathematical guarantee of redundancy in complex systems. It means that as long as a network is built with a specific kind of symmetry, it is mathematically impossible for it to be easily disrupted.
From the abstract
Given a digraph $D$, let $c(D)$ denote the largest integer $k$ such that there exists a collection of $k$ openly disjoint cycles through a vertex, i.e., a collection of directed cycles $C_1,\ldots,C_k$ through a common vertex $v$ such that $C_1-v,\ldots,C_k-v$ are pairwise vertex-disjoint. The famous Caccetta-Häggkvist conjecture and its regular variant due to Behzad, Chartrand and Wall from 1970, have motivated the study of degree conditions forcing $c(D)$ to be large.Surprisingly, in 1985 Thom