Defining bicircular matroids in monadic logic

2020/05/09 by Funk, Daryl, Mayhew, Dillon, Newman, Mike · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2005.04526

Abstract

We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not depend on an excluded-minor characterisation.

Cited by

• Monadic non-definability and gain-graphic matroids

Related

• Monadic transductions and definable classes of matroids
• Tree automata and pigeonhole classes of matroids: II
• Tree automata and pigeonhole classes of matroids: I
• Is the missing axiom of matroid theory lost forever?
• Monadic second-order model-checking on decomposable matroids