当前位置: X-MOL 学术Adv. Appl. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Disjoint non-balanced A-paths in biased graphs
Advances in Applied Mathematics ( IF 1.0 ) Pub Date : 2020-02-01 , DOI: 10.1016/j.aam.2020.102014
Jim Geelen , Cynthia Rodriguez

Abstract Let A be a set of vertices in a graph G. An A-path is a non-trivial path in G that has both of its ends in A. In 1961, Gallai showed that, for any integer k, either G has k disjoint A-paths or there is a set of at most 2 ( k − 1 ) vertices that hits all of the A-paths. There have been a number of extensions of this result; in each of these extensions we want to find a maximum collection of disjoint “allowable” A-paths, where the collection of allowed A-paths varies according to the application. We prove a new extension of this type, in the context of biased graphs, unifying many of the others.

中文翻译:

有偏图中不相交的非平衡 A 路径

摘要 令 A 是图 G 中的一组顶点。A 路径是 G 中的一条非平凡路径,其两端都在 A 中。1961 年,Gallai 表明,对于任何整数 k,G 中的任意一个都有 k不相交的 A 路径或有一组最多 2 ( k − 1 ) 个顶点命中所有 A 路径。这个结果有许多扩展;在这些扩展中的每一个中,我们希望找到最大的不相交“允许”A 路径集合,其中允许的 A 路径集合根据应用程序而变化。我们证明了这种类型的新扩展,在有偏图的背景下,统一了许多其他图。
更新日期:2020-02-01
down
wechat
bug