Odd circuits in dense binary matroids

Abstract: We show that, for each real number

a l p h a > 0

and odd integer

k g e 5

there is an integer

c

such that, if

M

is a simple binary matroid with

| M | g e a l p h a 2^{r (M)}

and with no

k

-element circuit, then

M

has critical number at most

c

. The result is an easy application of a regularity lemma for finite abelian groups due to Green.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Odd circuits in dense binary matroids