2024/09/18 by Stylianou, Stelios
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Combinatorics (math.CO) #Computer science #Cooperative Communication and Network Coding #Distributed systems and fault tolerance #FOS: Mathematics #Mathematics
paper · pdf · doi:10.48550/arxiv.2409.12137
openalex publication_date 2024/09/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We say a directed graph G on n vertices is irredundant if the removal of any edge reduces the number of ordered pairs of distinct vertices (u,v) such that there exists a directed path from u to v. We determine the maximum possible number of edges such a graph can have, for every n ∈ ℕ. We also characterize the cases of equality. This resolves, in a strong form, a question of Crane and Russell.