Jorn van der Pol

activity

20142022

collaborators

4 papers

math.CO2022

Random GF(q)-representable matroids are not (b,c)-decomposable

Jorn van der Pol

We show that a random subset of the rank- $n$ projective geometry $PG (n - 1, q)$ is, with high probability, not $(b, c)$ -decomposable: if $k$ is its colouring number, it does not…

math.CO2021

Tuza's conjecture for binary geometries

Kazuhiro Nomoto, Jorn van der Pol

Tuza (A conjecture, in Proceedings of the Colloquia Mathematica Societatis Janos Bolyai, 1981) conjectured that $τ (G) \leq 2 ν (G)$ for all graphs $G$ , where $τ (G)$ is the minimum siz…

math.CO2016

Asymptotics of Symmetry in Matroids

Rudi Pendavingh, Jorn van der Pol

We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asympto…

math.CO2014

On the number of matroids compared to the number of sparse paving matroids

Rudi Pendavingh, Jorn van der Pol

It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $lim_{n \to \infty} s_{n} / m_{n} = 1$ , where…