3 problems

Strengthened circular-flow conjecture.

Planar Circular Flow Conjecture. Every $4k$-edge-connected planar graph admits a circular $(2+\frac{1}{k})$-flow.

Let $G$ be a graph and let a circular $(3+\epsilon)$-NZF mean a circular nowhere-zero flow with parameter $3+\epsilon$. Circular-flow threshold conjecture. For $\epsilon\in[0,1]$,…