The well-quasi-ordering conjecture for finite-field-representable matroids
The well-quasi-ordering conjecture for finite-field-representable matroids
Let be a finite field. A set of matroids is well-quasi-ordered by the minor relation when every infinite set contains two matroids, one of which is isomorphic to a minor of the other.
Well-quasi-ordering conjecture. Any infinite set of -representable matroids contains two matroids, one of which is isomorphic to a minor of the other.
A positive answer would imply that every minor-closed class of -representable matroids has finitely many -representable excluded minors. The conjecture is attributed to Neil Robertson and Paul Seymour and is discussed in the context of extending the Graph Minors project to matroids representable over finite fields; its resolution is not supplied here.
Sources & referencesView supporting material
Primary source
Dillon Mayhew, Gordon Royle and Geoff Whittle, “Excluding Kuratowski graphs and their duals from binary matroids”, arXiv:0902.0198 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.