The structure of the 3-separations of 3-connected matroids. II.

DOI10.1016/J.EJC.2006.01.007MaRDI QIDQ875060zbMATH OpenOpenAlexFDO

Authors Charles Semple, James Oxley, Geoff Whittle

Publication date 10 April 2007

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2006.01.007

zbMATH Keywords

3-connected matroidsmatroiduniqueness property

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

The authors showed in Part I [\textit{J. Oxley, C. Semple} and \textit{G. Whittle}, J. Comb. Theory, Ser. B 92, No.~2, 257--293 (2004; Zbl 1059.05032)] that every 3-connected matroid \(M\) with at least nine elements has a tree decomposition that displays, up to equivalence, all non-sequential 3-separations. The purpose of the paper under review is to show that if certain natural conditions are imposed on the tree, then it has a uniqueness property. In particular, suppose that, from every pair of edges that meet at a degree-2 vertex and have their other ends of degree at least three, one edge is contracted. Then the resulting tree is unique.

Recommendations

• The structure of the 3-separations of 3-connected matroids
• Exposing 3-separations in 3-connected matroids
• The structure of 2-separations of infinite matroids
• Constructing a 3-tree for a 3-connected matroid
• The structure of the 4-separations in 4-connected matroids

Cites work

• A Combinatorial Decomposition Theory
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• The structure of 3-connected matroids of path width three
• The structure of equivalent 3-separations in a 3-connected matroid
• The structure of the 3-separations of 3-connected matroids

Cited in

(19)

• Constructing a 3-tree for a 3-connected matroid
• Crossing 3-separations in 3-connected matroids
• An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
• On Seymour's decomposition theorem
• Isotropic matroids. III: Connectivity
• Wild triangles in 3-connected matroids
• A chain theorem for matroids
• The structure of equivalent 3-separations in a 3-connected matroid
• Decomposing infinite matroids into their 3-connected minors
• Inequivalent representations of matroids over prime fields
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Decomposition of 3-connected representable matroids
• The structure of the 4-separations in 4-connected matroids
• Clonal cores and flexipaths in matroids
• The structure of the 3-separations of 3-connected matroids
• Exposing 3-separations in 3-connected matroids
• Tangles, trees, and flowers
• The structure of 3-connected matroids of path width three
• The 3-connected matroids with circumference 6

This page was built for publication: The structure of the 3-separations of 3-connected matroids. II.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875060)