Efficient pigeonhole conjecture for bicircular and gain-graphic matroids
Efficient pigeonhole conjecture for bicircular and gain-graphic matroids
Let be a finite group. Efficient pigeonhole conjecture. The class of bicircular matroids is efficiently pigeonhole, and the class of -gain-graphic matroids is efficiently pigeonhole. The surrounding discussion presents these as conjectures about classes for which efficient pigeonhole structure is expected; no resolution is supplied in the paper excerpt.
Sources & referencesView supporting material
Primary source
Daryl Funk, Dillon Mayhew and Mike Newman, “Tree automata and pigeonhole classes of matroids: II”, arXiv:1910.04361 (2023).
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.