Path degeneracy and applications
By: Y. Lin, P. Ossona de Mendez
Potential Business Impact:
Helps map out complex networks more efficiently.
In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of $g$-cages is verified). As an application, we derive bounds on the generalized acyclic indices, on the generalized arboricities, and on the weak coloring numbers of high-girth graphs in such classes. Along the way, we prove a conjecture proposed in [T.~Bartnicki et al., Generalized arboricity of graphs with large girth, Discrete Mathematics 342 (2019), no.~5, 1343--1350.], which asserts that, for every integer $k$, there is an integer $g(p,k)$ such that every $K_k$ minor-free graph with girth at least $g(p,k)$ has $p$-arboricity at most $p+1$.
Similar Papers
The Linear Arboricity Conjecture for Graphs with Large Girth
Combinatorics
Helps map networks by finding fewer paths.
Polynomial Bounds in the Apex Minor Theorem
Combinatorics
Finds simpler ways to draw complex maps.
On graphs coverable by chubby shortest paths
Combinatorics
Finds patterns in networks for better computer problem-solving.