The Fibonacci upper-bound conjecture for source-to-sink paths
Statement
Let and for . Consider a 3-regular, 3-edge connected, acyclic directed graph with a unique source and a unique sink on vertices. Fibonacci upper-bound conjecture. Such a graph has at most source-to-sink paths, where denotes the Fibonacci number. This removes the planarity restriction from the cited planar conjecture; the optimal graph is described as the wedge of an -gon over an edge, but the asserted bound remains open in the source.
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.