ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F1=F2=1F_1=F_2=1 and Fn=Fn−1+Fn−2F_n=F_{n-1}+F_{n-2} for n3n 3. Consider a 3-regular, 3-edge connected, acyclic directed graph with a unique source and a unique sink on 2n2n vertices. Fibonacci upper-bound conjecture. Such a graph has at most Fn+2+1F_{n+2}+1 source-to-sink paths, where Fn+2F_{n+2} denotes the (n+2)th(n+2)^{\mathrm{th}} Fibonacci number. This removes the planarity restriction from the cited planar conjecture; the optimal graph is described as the wedge of an (n+1)(n+1)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.