Abstract

A 3-connected matroid M is sequential or has path width 3 if its ground set E ( M ) has a sequential ordering, that is, an ordering ( e 1 , e 2 , … , e n ) such that ( { e 1 , e 2 , … , e k } , { e k + 1 , e k + 2 , … , e n } ) is a 3-separation for all k in { 3 , 4 , … , n − 3 } . In this paper, we consider the possible sequential orderings that such a matroid can have. In particular, we prove that M essentially has two fixed ends, each of which is a maximal segment, a maximal cosegment, or a maximal fan. We also identify the possible structures in M that account for different sequential orderings of E ( M ) . These results rely on an earlier paper of the authors that describes the structure of equivalent non-sequential 3-separations in a 3-connected matroid. Those results are extended here to describe the structure of equivalent sequential 3-separations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.