The 3-connected matroids with circumference 6
نویسندگان
چکیده
We construct all 3-connected matroids with circumference equal to 6 having rank at least 8. A matroid belongs to this family if and only if it is a generalized parallel connection of a set of planes along a common line (which may have some virtual points).
منابع مشابه
The 3-connected Binary Matroids with Circumference
In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank.
متن کاملThe 3-connected binary matroids with circumference 6 or 7
In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank. © 2008 Elsevier Ltd. All rights reserved.
متن کاملOn size, circumference and circuit removal in 3-connected matroids
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that, for such a matroid M , (i) if the rank r(M) of M is at least six, then the circumference c(M) of M is at least six and, provided |E(M)| ≥ 4r(M)− 5, there is a circuit whose deletion from M leaves a 3-connected matroid; (ii) if r(M) ≥ 4 and M has a basis B such that M\e is not 3-connected for al...
متن کاملStabilizers of Classes of Representable Matroids
Let M be a class of matroids representable over a field F. A matroid N # M stabilizes M if, for any 3-connected matroid M # M, an F-representation of M is uniquely determined by a representation of any one of its N-minors. One of the main theorems of this paper proves that if M is minor-closed and closed under duals, and N is 3-connected, then to show that N is a stabilizer it suffices to check...
متن کاملOn the number of triangles in 3-connected matroids
An element e of a 3-connected matroid M is said to be contractible provided that M/e is 3-connected. In this paper, we show that a 3-connected matroid M with exactly k contractible elements has at least max { r(M) + 6− 2k 4 , |E(M)| + 6− 3k 5 } triangles. For each k, we construct an infinite family of matroids that attain this bound. New sharp bounds for the number of triads of a minimally 3-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010