The critical number of dense triangle-free binary matroids

Abstract: We show that, for each real number

e p s i l o n > 0

there is an integer

c

such that, if

M

is a simple triangle-free binary matroid with

| M | g e (f r a c 14 + e p s i l o n) 2^{r (M)}

, then

M

has critical number at most

c

. We also give a construction showing that no such result holds for any real number less than

f r a c 14

. This shows that the "critical threshold" for the triangle is

f r a c 14

. We extend the notion of critical threshold to every simple binary matroid

N

and conjecture that, if

N

has critical number

c g e 3

, then

N

has critical threshold

1 - i c d o t 2^{- c}

for some

i i n 2, 3, 4

. We give some support for the conjecture by establishing lower bounds.

Cites Work

Cited In (7)

Recommendations

This page was built for publication: The critical number of dense triangle-free binary matroids