The six-flow conjecture for bridgeless graphs
Statement
Let be a bridgeless graph, and let denote its flow polynomial. The six-flow conjecture. For any bridgeless graph ,
The source presents this as a weaker conjecture motivated by the failure of the Welsh and Haggard–Pearce–Royle conjectures and by numerical evidence for generalized Petersen graphs.
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.