20 problems
- 0 votes0 replies1 view
Welsh's conjecture on real flow roots
Let be a bridgeless graph, and let denote its flow polynomial. Welsh's conjecture. For any bridgeless graph , … The conjecture parallels the Birkhoff–Lewis resul…
- 0 votes0 replies0 views
Finiteness conjecture for cyclically 4-connected cubic flow roots
Let be a cyclically 4-connected cubic graph, and let denote its flow polynomial. Let . Finiteness conjecture. For every , only finitel…
- 0 votes0 replies0 views
Conjecture on flow roots of 3-connected graphs
Let be a 3-connected graph with vertices and edges, and let denote its flow polynomial. Let be the flow root of in . 3-connecte…
- 0 votes0 replies1 view
The golden inequality characterization of planarity for cubic graphs
Let be a cubic bridgeless graph with edges, let denote its flow polynomial, and let be the golden ratio. Golden inequality conjecture. … More…
- 0 votes0 replies1 view
Jackson–Salas' eventual positivity conjecture for flow polynomials
Let denote the flow polynomial of a graph . Jackson–Salas' eventual positivity conjecture. There exists such that … for all -connected graphs …
- 0 votes0 replies1 view
Conjugate golden identity inequality conjecture for cubic bridgeless graphs
Conjugate golden identity inequality conjecture. For any cubic bridgeless graph ,
- 0 votes0 replies1 view
The real flow-root conjecture for bridgeless graphs
Let be a bridgeless graph, and let the flow roots of be the roots of its flow polynomial . Real flow-root conjecture. If all flow roots of are real, then…
- 0 votes0 replies0 views
The closed-flow enumeration conjecture for forks
Let be the fork with vertices and stem of size , and let denote the number of closed flows of size on thi…
- 0 votes0 replies0 views
Unbounded-critical-point conjecture for non-planar Potts-model zeros
Consider a family of non-planar connected graphs with identical layers of width and periodic boundary conditions in the -direction, together with a curve…
- 0 votes0 replies0 views
Eigenvalue-crossing conjecture for non-planar transfer matrices
Consider a family of non-planar connected graphs as above. Let be the smallest for which the transfer matrix for the fu…
- 0 votes0 replies0 views
Flow-zero accumulation conjecture for non-planar graph families
Consider a family of non-planar connected graphs made of identical layers of width , with periodic boundary conditions in the -direction. Let an…
- 0 votes0 replies0 views
Asymptotic real-flow-root conjecture for generalized Petersen graphs
Let be the generalized Petersen graph family and let be the associated real crossing value. Asymptotic real-flow-root conjecture. There exists a real number…
- 0 votes0 replies0 views
Dominant-eigenvalue pattern conjecture for generalized Petersen limiting curves
For a family of generalized Petersen graphs , let be the real crossing value and let denote the indicated dominant eigenvalues. Domi…
- 0 votes0 replies0 views
Density conjecture for accumulation points of generalized Petersen flow zeros
Let be the limiting curve conjecturally obtained from the curves after removing their outward branches. Density conjecture. The set of accumula…
- 0 votes0 replies0 views
Limiting-curve convergence conjecture for generalized Petersen graphs
For each , let be the limiting curve of flow-polynomial zeros for , with its outward branches removed. Limiting-curve convergence conjecture. As…
- 0 votes0 replies0 views
Outward-branch conjecture for limiting flow-root curves
For fixed , let be the limiting curve of non-isolated accumulation points of zeros of as . Let denote the asympt…
- 0 votes0 replies0 views
Large-n real-root conjecture for low-width generalized Petersen graphs
For , consider the flow polynomials of the generalized Petersen graphs as varies. Low-width real-root conjecture. The fact that all computed flow roots…
- 0 votes0 replies0 views
Complete-decomposition conjecture for generalized Petersen graph flow polynomials
Let be a generalized Petersen graph, and let its flow polynomial be expressed through the transfer-matrix eigenvalues appearing in the complete decomposition for…
- 0 votes0 replies0 views
The six-flow conjecture for bridgeless graphs
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 conject…
- 0 votes0 replies0 views
Haggard–Pearce–Royle conjecture on flow roots above five
Let be a bridgeless graph, and let denote its flow polynomial. Haggard–Pearce–Royle conjecture. For any bridgeless graph , … This is a proposed weakening of Wels…