Connected matroids with a small circumference
نویسندگان
چکیده
منابع مشابه
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 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 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...
متن کاملTowards a Splitter Theorem for Internally 4-connected Binary Matroids Viii: Small Matroids
Our splitter theorem studies pairs of the form (M,N), where M and N are internally 4-connected binary matroids, M has a proper N -minor, and if M ′ is an internally 4-connected matroid such that M has a proper M ′-minor and M ′ has an N -minor, then |E(M)|− |E(M ′)| > 3. The analysis in the splitter theorem requires the constraint |E(M)| ≥ 16. In this article, we complement that analysis by des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00377-1