Mike Newman

activity

20122022

most citedThe optimal bound on the 3-independence number obtainable from a polynomial-type method

7 citations · 13 across the 5 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 2 cited

Tree automata and pigeonhole classes of matroids: II

Daryl Funk, Dillon Mayhew, Mike Newman

Let $ψ$ be a sentence in the counting monadic second-order logic of matroids and let $F$ be a finite field. Hliněný's Theorem says that we can test whether $F$ -re…

math.CO2019★ 2 cited

Tree automata and pigeonhole classes of matroids: I

Daryl Funk, Dillon Mayhew, Mike Newman

Hlineny's Theorem shows that any sentence in the monadic second-order logic of matroids can be tested in polynomial time, when the input is limited to a class of F-representable ma…

math.CO2019

Fractal classes of matroids

Dillon Mayhew, Mike Newman, Geoff Whittle

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that…