2 papers
math.CO2026
Counting geodesic paths in graphs
Martin Knor, Jelena Sedlar, Riste Å krekovski +1
A geodesic is a shortest path which connects a pair of vertices of a graph G. In this paper we define the geodesic subpath number gpn(G) of a graph G as the number of geodesics in…
math.CO2026
Polylogarithmic Bounds for Nested Cycles without Geometric Crossings
Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang
A problem of ErdÅs asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossin…