On Maximum-sized k-Regular Matroids
نویسنده
چکیده
Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and near-regular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1 vertices. A simple rank–r near-regular matroid has the maximum number of points if and only if it is isomorphic to the simplification of T M(K3)(M(Kr+2)), that is, the simplification of the matroid obtained, geometrically, by freely adding a point to a 3–point line of M(Kr+2) and then contracting this point. This paper determines the maximum number of points that a simple rank– r k–regular matroid can have and determines all such matroids having this number. With one exception, there is exactly one such matroid. This matroid is isomorphic to the simplification of T M(Kk+2)(M(Kr+k+1)), that is, the simplification of the matroid obtained, geometrically, by freely adding k independent points to a flat of M(Kr+k+1) isomorphic to M(Kk+2) and then contracting each of these points.
منابع مشابه
k-Regular Matroids
The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF (2) is the class of near-regular matroids. Let k be a non-negative integer. This thesis considers the class of k–regular matroids, a generalization of the last two classes. Indeed, the classes of regular and near-regular matroids coincide wi...
متن کاملAn Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملM ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملMatroid Secretary for Regular and Decomposable Matroids
In the matroid secretary problem we are given a stream of elements in random order and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocable: if we choose to accept an element when it is presented by the stream then we can never get ri...
متن کاملNowhere-zero Flows in Regular Matroids and Hadwiger’s Conjecture
We present a tool that shows, that the existence of a k-nowhere-zero-flow is compatible with 1-,2and 3-sums in regular matroids. As application we present a conjecture for regular matroids that is equivalent to Hadwiger’s conjecture for graphs and Tuttes’s 4and 5-flow conjectures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 15 شماره
صفحات -
تاریخ انتشار 1999