发表机构
Universidade Federal de Pernambuco; Guizhou Minzu University; Universidade Federal de Alagoas（伯南布哥联邦大学; 贵州民族大学; 阿拉戈阿斯联邦大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对图的边强分离问题，将任意n顶点图所需的路径数上界从19n改进至10n-o(n)。
AI 中文摘要
如果一个路径族中的每条路径都能在两个方向上分离图中任意两条不同的边，则该路径族强分离图的边。Bonamy、Botler、Dross、Naia和Skokan证明了每个$n$顶点图都允许至多$19n$条路径的这样的族。我们将这个界改进到$10n-o(n)$。
英文摘要
A family of paths strongly separates the edges of a graph if every two distinct edges are separated in both directions by paths in the family. Bonamy, Botler, Dross, Naia, and Skokan proved that every $n$-vertex graph admits such a family of at most $19n$ paths. We improve this bound to $10n-o(n)$.
Comments8 pages
