Exact 2-dimensional flow number conjecture for the Petersen graph
Statement
Let be the Petersen graph, and let denote its -dimensional flow number.
Petersen graph flow-number conjecture.
The paper gives the matching upper bound and proposes equality based on computational evidence; no proof of the lower bound is known.
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.