Jorn G. van der Pol

According to our database, Jorn G. van der Pol authored at least 11 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Almost Every Matroid has an $M(K_4)$- or a $\mathcal{W}^3$-Minor.

Jorn G. van der Pol

Electron. J. Comb., 2023

2022

Enumeration of extensions of the cycle matroid of a complete graph.

Peter Nelson, Shayla Redlin, Jorn G. van der Pol

Adv. Appl. Math., 2022

2019

On the Number of Biased Graphs.

Peter Nelson, Jorn G. van der Pol

SIAM J. Discret. Math., 2019

Asymptotics of symmetry in matroids.

Rudi Pendavingh, Jorn G. van der Pol

J. Comb. Theory, Ser. B, 2019

2018

Doubly Exponentially Many Ingleton Matroids.

Peter Nelson, Jorn G. van der Pol

SIAM J. Discret. Math., 2018

On the Number of Bases of Almost All Matroids.

Rudi Pendavingh, Jorn G. van der Pol

Comb., 2018

2017

Enumerating Matroids of Fixed Rank.

Rudi Pendavingh, Jorn G. van der Pol

Electron. J. Comb., 2017

2015

Counting matroids in minor-closed classes.

Rudi Pendavingh, Jorn G. van der Pol

J. Comb. Theory, Ser. B, 2015

On the Number of Matroids Compared to the Number of Sparse Paving Matroids.

Rudi Pendavingh, Jorn G. van der Pol

Electron. J. Comb., 2015

On the number of matroids.

Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol

Comb., 2015

2014

An entropy argument for counting matroids.

Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol

J. Comb. Theory, Ser. B, 2014