Geelen–Gerards–Whittle polynomial-time girth conjecture for proper minor-closed classes
Statement
Let be a proper minor-closed class of binary matroids. Geelen–Gerards–Whittle's conjecture. There is a polynomial-time algorithm for computing the girth of matroids in . This conjecture connects the tractability of girth computation with structural restrictions on binary matroid classes; the paper studies an algorithmic result for perturbed graphic matroids, while the conjecture concerns every proper minor-closed class of binary matroids.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.