Growth rate functions of dense classes of representable matroids

نویسنده

  • Peter Nelson
چکیده

For each proper minor-closed subclassM of the GF(q)representable matroids containing all GF(q)-representable matroids, we give, for all large r, a tight upper bound on the number of points in a rank-r matroid inM, and give a rank-r matroid inM for which equality holds. As a consequence, we give a tight upper bound on the number of points in a GF(q)-representable, rank-r matroid of large rank with no PG(k, q)-minor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponentially Dense Matroids

This thesis deals with questions relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that does not contain a given rank-2 uniform matroid. The growth rate function is defined by hM(n) = max (|M | : M ∈M simple, r(M) ≤ n) . The Growth Rate Theorem, due to Geelen, Kabell, Kung, and Whittle, shows that the growth rate function is ...

متن کامل

Odd circuits in dense binary matroids

The exclusion of odd circuits from a binary matroid here is natural. The geometric density Hales-Jewett theorem [3] implies that dense GF(q)representable matroids with sufficiently large rank necessarily contain arbitrarily large affine geometries over GF(q); these geometries contain circuits of every possible even cardinality when q= 2 and circuits of every possible cardinality when q>2. So de...

متن کامل

Matroids Denser than a Projective Geometry

The growth-rate function for a minor-closed class M of matroids is the function h where, for each non-negative integer r, h(r) is the maximum number of elements of a simple matroid in M with rank at most r. The Growth-Rate Theorem of Geelen, Kabell, Kung, and Whittle shows, essentially, that the growth-rate function is always either linear, quadratic, exponential with some prime power q as the ...

متن کامل

On Matroids Representable over Gf (3) and Other Fields

The matroids that are representable over GF (3) and some other fields depend on the choice of field. This paper gives matrix characterisations of the classes that arise. These characterisations are analogues of the characterisation of regular matroids as the ones that can be represented over the rationals by a totally-unimodular matrix. Some consequences of the theory are as follows. A matroid ...

متن کامل

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...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2013