On singleton 1-rounded sets of matroids

From MaRDI portal





This paper is concerned with the problem of relating the existence of certain minors in a matroid to particular elements of the matroid. For a positive integer \(k\), \textit{P. D. Seymour} [Minors of 3-connected matroids (to appear)] has defined a set \(\mathcal S\) of matroids to be \(k\)-rounded if every member of \(\mathcal S\) is \((k+1)\)-connected and the following condition holds: if \(M\) is a \((k+1)\)-connected matroid having an \(\mathcal S\)-minor and \(X\) is a subset of \(E(M)\) having at most \(k\) elements, then \(M\) has an \(\mathcal S\)-minor that contains \(X\) in its ground set. \textit{R. E. Bixby} [Discrete Math. 8, 139--145 (1974; Zbl 0279.05027)] proved that the set \(\{U_{2,4}\}\) is 1-rounded and \textit{P. D. Seymour} [J. Comb. Theory, Ser. B 22, 289--295 (1977; Zbl 0385.05021)] found a quick test to determine whether a particular set is 1-rounded using this to show that each of the following sets is 1-rounded \((F\) denotes the Fano matroid): \(\{U_{2,4},M(K_ 4)\}\), \(\{U_{2,3},F,F^*\}\) and \(\{U_{2,5},U_{3,5},F,F^*\}.\) Seymour also showed that \(\{U_{2,4}\}\) is 2-rounded and developed a test for 2-rounded sets similar to his test for 1-rounded sets. This paper uses these tests to show that there are precisely eight 1-rounded singleton sets of matroids, and precisely four 2-rounded singleton sets of matroids, the latter being \(\{U_{1,2}\}\), \(\{U_{1,3}\}\), \(\{U_{2,3}\}\) and \(\{U_{2,4}\}\).











This page was built for publication: On singleton 1-rounded sets of matroids

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