Jorn G. van der Pol - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2023

Almost Every Matroid has an $M(K_4)$- or a $\mathcal{W}^3$-MinorJorn G. van der Pol. combinatorics, 30(4), 2023. [doi]

2022

Enumeration of extensions of the cycle matroid of a complete graphPeter Nelson, Shayla Redlin, Jorn G. van der Pol. aam, 138:102343, 2022. [doi]

2019

On the Number of Biased GraphsPeter Nelson, Jorn G. van der Pol. siamdm, 33(1):373-382, 2019. [doi]

Asymptotics of symmetry in matroidsRudi Pendavingh, Jorn G. van der Pol. JCT, 135:349-365, 2019. [doi]

2018

Doubly Exponentially Many Ingleton MatroidsPeter Nelson, Jorn G. van der Pol. siamdm, 32(2):1145-1153, 2018. [doi]

On the Number of Bases of Almost All MatroidsRudi Pendavingh, Jorn G. van der Pol. combinatorica, 38(4):955-985, 2018. [doi]

2017

Enumerating Matroids of Fixed RankRudi Pendavingh, Jorn G. van der Pol. combinatorics, 24(1):1, 2017. [doi]

2015

On the number of matroidsNikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol. combinatorica, 35(3):253-277, 2015. [doi]

On the Number of Matroids Compared to the Number of Sparse Paving MatroidsRudi Pendavingh, Jorn G. van der Pol. combinatorics, 22(2):2, 2015. [doi]

Counting matroids in minor-closed classesRudi Pendavingh, Jorn G. van der Pol. JCT, 111:126-147, 2015. [doi]

2013

On the number of matroidsNikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol. soda 2013: 675-694 [doi]

Sign in or sign up to see more results.

runs on WebDSL