Exact 2-dimensional flow number conjecture for the Petersen graph
Exact 2-dimensional flow number conjecture for the Petersen graph
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.
Sources & referencesView supporting material
Primary source
Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník and Gloria Tabarelli, “On d-dimensional nowhere-zero r-flows on a graph”, arXiv:2304.14231 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.