کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9505926 | 1340362 | 2005 | 59 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The structure of equivalent 3-separations in a 3-connected matroid
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M that displays all of its 2-separations. This result was extended by Oxley, Semple, and Whittle, who showed that, when M is 3-connected, there is a corresponding tree decomposition that displays all non-trivial 3-separations of M up to a certain natural equivalence. This equivalence is based on the notion of the full closure fcl(Y) of a set Y in M, which is obtained by beginning with Y and alternately applying the closure operators of M and Mâ until no new elements can be added. Two 3-separations (Y1,Y2) and (Z1,Z2) are equivalent if {fcl(Y1),fcl(Y2)}={fcl(Z1),fcl(Z2)}. The purpose of this paper is to identify all the structures in M that lead to two 3-separations being equivalent and to describe the precise role these structures have in determining this equivalence.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Advances in Applied Mathematics - Volume 35, Issue 2, August 2005, Pages 123-181
Journal: Advances in Applied Mathematics - Volume 35, Issue 2, August 2005, Pages 123-181
نویسندگان
Rhiannon Hall, James Oxley, Charles Semple,