28 problems
Let be the unit -sphere. Spherical coloring conjecture. There exists a map such that antipodal points…
Let be a bridgeless cubic graph. An -flow is a unit vector flow with values on the unit sphere . Bobby's spherical flow conjecture. Every bridgeless…
Let be a surface. Robertson's surface conjecture. There is a constant such that every -edge-connected graph embedded in with representativity at least has a nowh…
Let be a -edge-connected graph embedded in the torus. Robertson's conjecture. If the representativity of the embedding is at least , then has a nowhere-zero -flow.…
Mixed-graph threshold orientation conjecture. There is a constant such that every mixed graph with minimum pseudo dicut size at least has an orientation satisfying
Mixed-graph orientation conjecture. There is a constant such that for every mixed graph , there is an orientation such that
Fan's weighted refinement. If there is a -flow such that
A - design consists of a -element point set and a collection of -subsets of , called blocks, such that every -subset…
A Steiner triple system is a - design. A zero-sum -flow of a design is a map … such that the sum of the values over all…
Let be a smooth connected compact manifold, and let a smooth flow be a smooth action on . The flow is globally hypoelliptic if its associated leafwise Laplacian…
Exponential flow-count conjecture. There exists a fixed constant such that, for every such , , and , there are at least flows avoiding .
Neumann-Lara's conjecture. Every loopless planar digraph admits an NL--coflow.
Let a flow, equivalently a vector field, be given on a manifold. A singular hyperbolic flow is one whose invariant sets admit the corresponding singular-hyperbolic structure; a hom…
Let a flow, equivalently a vector field, be given on a manifold. A flow is hyperbolic if its chain recurrent dynamics are hyperbolic; a singular cycle is a cycle involving singular…
Open-and-dense sink/source conjecture. There exists an open and dense family of continuous flows or smooth semiflows on manifolds for which sectional asymptotic expansion or contra…
Mean-dimension embedding conjecture. If
Let be a graph, and let denote its edge set. A 3-flow on is a flow whose values lie in a group of order three, and its support is the set of edges on which the flow…
Let be a graph and let . A graph is -extendable at if every pre-orientation of the edges incident with whose out-degree min…
Let be a finite graph without loops, possibly with multiple edges. A graph is -connected if, for every zero-sum function , there is an…
Let be a bridgeless cubic graph. A 5-line Fano-flow is a Fano-flow in which at most five lines of the Fano plane occur as flow values at vertices. Five-line Fano-flow conjectur…
0-sum 3-flow conjecture. Every -edge connected -regular graph admits a -sum -flow.
Facet-connectivity reduction conjecture. If every -facet-connected complex has a -flow for some , then every -facet-connected complex also…
Linear simplicial Tutte flow conjecture.
Simplicial Tutte flow conjecture. For every dimension there exists a number such that every bridgeless complex of dimension has a nowhere-zero -flow f…
Rohlin-property characterization conjecture. The following three conditions are equivalent: