P. Nelson

activity

20112026

most citedAlmost all matroids are non-representable

18 citations · 38 across the 33 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

2 papers · 2 filters

math.CO2015

On the structure of dense triangle-free binary matroids

Rutger Campbell, Jim Geelen, Peter Nelson

We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $∣ M ∣ > \frac{33}{128} 2^{r (M)}$ has critical number at most $2$ .

math.CO2015

On the probability that a random subgraph contains a circuit

Peter Nelson

Let $μ > 2$ and $ε > 0$ . We show that, if $G$ is a sufficiently large simple graph of average degree at least $μ$ , and $H$ is a random spanning subgraph of $G$ formed by including ea…