当前位置: X-MOL 学术Discrete Appl. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A PPA parity theorem about trees in a bipartite graph
Discrete Applied Mathematics ( IF 1.0 ) Pub Date : 2020-04-01 , DOI: 10.1016/j.dam.2020.03.064
Kathie Cameron , Jack Edmonds

Abstract We prove a new PPA parity theorem: Given a bipartite graph G with bipartition ( A , B ) where B is a set of even-degree vertices, and given a tree T ∗ of G containing all of A , such that any vertex of B in T ∗ has degree 2 in T ∗ and such that each vertex of A which is not a leaf of T ∗ is met by an odd number of edges not in T ∗ , then there is an even number of trees of G containing all of A , with degree 0 or 2 at each vertex of B and with the same degree as T ∗ at each vertex of A . This theorem generalizes Berman’s generalization of Thomason’s generalization of Smith’s Theorem.

中文翻译:

关于二部图中树的 PPA 奇偶定理

摘要 我们证明了一个新的 PPA 奇偶定理:给定一个二分图 G,其中 B 是一组偶数顶点,并且给定一个包含所有 A 的 G 的树 T*,使得任意顶点T ∗ 中的 B 在 T ∗ 中的度数为 2 并且 A 的每个不是 T ∗ 叶子的顶点都遇到奇数个不在 T ∗ 中的边,那么 G 的偶数树包含所有的 A ,在 B 的每个顶点处的度数为 0 或 2,并且在 A 的每个顶点处的度数与 T * 相同。这个定理概括了伯曼对 Thomason 对斯密定理的概括的概括。
更新日期:2020-04-01
down
wechat
bug