Almost all matroids are non-representable P Nelson arXiv preprint arXiv:1605.04288, 2016 | 85 | 2016 |
Bounding by a fraction of for graphs without large cliques M Bonamy, T Kelly, P Nelson, L Postle arXiv preprint arXiv:1803.01051, 2018 | 27* | 2018 |
The number of points in a matroid with no n-point line as a minor J Geelen, P Nelson Journal of Combinatorial Theory, Series B 100 (6), 625-630, 2010 | 16 | 2010 |
The critical number of dense triangle-free binary matroids J Geelen, P Nelson Journal of Combinatorial Theory, Series B 116, 238-249, 2016 | 13 | 2016 |
The structure of claw-free binary matroids P Nelson, K Nomoto Journal of Combinatorial Theory, Series B 150, 76-118, 2021 | 12 | 2021 |
An analogue of the Erdős-Stone theorem for finite geometries J Geelen, P Nelson Combinatorica 35, 209-214, 2015 | 12 | 2015 |
Matroids denser than a clique J Geelen, P Nelson Journal of Combinatorial Theory, Series B 114, 51-69, 2015 | 11 | 2015 |
A density Hales–Jewett theorem for matroids J Geelen, P Nelson Journal of Combinatorial Theory, Series B 112, 70-77, 2015 | 11 | 2015 |
Exponentially dense matroids P Nelson University of Waterloo, 2011 | 10 | 2011 |
Growth rate functions of dense classes of representable matroids P Nelson Journal of Combinatorial Theory, Series B 103 (1), 75-92, 2013 | 9 | 2013 |
The structure of binary matroids with no induced claw or Fano plane restriction M Bonamy, F Kardos, T Kelly, P Nelson, L Postle arXiv preprint arXiv:1806.04188, 2018 | 8 | 2018 |
Doubly exponentially many Ingleton matroids P Nelson, J van der Pol SIAM Journal on Discrete Mathematics 32 (2), 1145-1153, 2018 | 8 | 2018 |
Excluding a line from C-representable matroids J Geelen, P Nelson, Z Walsh arXiv preprint arXiv:2101.12000, 2021 | 7 | 2021 |
On the existence of asymptotically good linear codes in minor-closed classes P Nelson, SHM van Zwam IEEE Transactions on Information Theory 61 (3), 1153-1158, 2015 | 7 | 2015 |
Sequential automatic algebras M Brough, B Khoussainov, P Nelson Logic and Theory of Algorithms: 4th Conference on Computability in Europe …, 2008 | 6 | 2008 |
The matroid secretary problem for minor-closed classes and random matroids T Huynh, P Nelson SIAM Journal on Discrete Mathematics 34 (1), 163-176, 2020 | 5 | 2020 |
The densest matroids in minor-closed classes with exponential growth rate J Geelen, P Nelson Transactions of the American Mathematical Society 369 (9), 6751-6776, 2017 | 5 | 2017 |
The extremal function for geometry minors of matroids over prime fields P Nelson, Z Walsh arXiv preprint arXiv:1703.03755, 2017 | 5 | 2017 |
Odd circuits in dense binary matroids J Geelen, P Nelson Combinatorica 37 (1), 41-47, 2017 | 5 | 2017 |
Projective geometries in exponentially dense matroids. I J Geelen, P Nelson Journal of Combinatorial Theory, Series B 113, 185-207, 2015 | 5 | 2015 |