J. Geelen

activity

20112022

most citedA generalization of the Grid Theorem

14 citations · 31 across the 21 of their papers we have counts for

collaborators

Showing 2014Show all

4 papers · 1 filter

math.CO2014

The densest matroids in minor-closed classes with exponential growth rate

Jim Geelen, Peter Nelson

The $growth rate function$ for a nonempty minor-closed class of matroids $M$ is the function $h_{M} (n)$ whose value at an integer $n \geq 0$ is define…

math.CO2014

Matroids denser than a clique

Jim Geelen, Peter Nelson

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 o…

math.CO2014★ 3 cited

The critical number of dense triangle-free binary matroids

Jim Geelen, Peter Nelson

We show that, for each real number $ε > 0$ there is an integer $c$ such that, if $M$ is a simple triangle-free binary matroid with $∣ M ∣ \geq (\frac{1}{4} + ε) 2^{r (M)}$ , then $M$ ha…

math.CO2014★ 2 cited

A geometric version of the Andrasfai-Erdos-Sos theorem

Jim Geelen

For each odd integer $k \geq 5$ , we prove that, if $M$ is a simple rank- $r$ binary matroid with no odd circuit of length less than $k$ and with $∣ M ∣ > k 2^{r - k + 1}$ , then $M$ is isomo…