Matroids with nine elements
نویسندگان
چکیده
We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this catalogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn, Crapo & Higgs. The matroids and associated data are stored in an online database, and we give three short examples of the use of this database.
منابع مشابه
Fe b 20 07 Matroids with nine elements
We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this cataogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn, Crapo & Higgs. The matroids and associated data are stored in an online database, and we give three short examples of the use of this database.
متن کاملWeak orientability of matroids and polynomial equations
This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over F2, originally alluded to by Bland and Jensen in their seminal paper on weak orientability. The Bland-Jensen linear equations for a matroid M have a solution if and only if M is weakly orientable. We use the Bland-Jensen system to determin...
متن کاملh-Vectors of Small Matroid Complexes
Stanley conjectured in 1977 that the h-vector of a matroid simplicial complex is a pure O-sequence. We give simple constructive proofs that the conjecture is true for matroids of rank less than or equal to 3, and corank 2. We used computers to verify that Stanley’s conjecture holds for all matroids on at most nine elements.
متن کاملOn the Number of Matroids Compared to the Number of Sparse Paving Matroids
It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that limn→∞ sn/mn = 1, where mn denotes the number of matroids on n elements, and sn the number of sparse paving matroids. In this paper, we show that lim n→∞ log sn logmn = 1. We prove this by arguing that each matroid on n elements has a faithful description consisti...
متن کاملOn the decomposition of ternary matroids
Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Matroids generalize linear dependence over vector spaces, and they also abstract the properties of graphs, in the former case they are called Vector Matroids, in the latter they are called Graphic Matroids [3]. The operation of Matroid Union was introduced by Nash-Williams in 1966. A matroid is i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 98 شماره
صفحات -
تاریخ انتشار 2008