Finite-group gain-graphic well-quasi-order conjecture
Finite-group gain-graphic well-quasi-order conjecture
Let be a finite group. A gain-graphic matroid is a frame matroid obtained from a graph with edge gains in , and a class is well-quasi-ordered when it has neither an infinite strict descending sequence nor an infinite antichain under the relevant minor relation. Finite-group gain-graphic well-quasi-order conjecture. The class of -gain graphic matroids is well-quasi-ordered. If true, every minor-closed class of -gain-graphic matroids would have at most finitely many excluded minors that are themselves -gain-graphic. The source says this is widely believed and expected to be approachable, at least for abelian , while the corresponding assertion fails for infinite groups.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Daryl Funk, Dillon Mayhew and Mike Newman, “Defining bicircular matroids in monadic logic”, arXiv:2005.04526 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.