Search arXivSearch

arXiv · 2603.23328

Graph Puzzles II.1: Counterexamples to Jain's Second Unit Vector Flows Conjecture

Abstract

A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related to this idea. First one suggests that such a flow exists for all bridgeless graphs. The second conjecture states that we can assign values $\{-4,-3,-2,-1,1,2,3,4\}$ to the points of $S^2$, such that antipodal points get opposite values, and values of any three equidistant points on great circles sum to zero. If both conjectures would be true, together they would imply Tutte's 5-flow conjecture. We show 2 counterexamples to the second conjecture, by constructing sets of points each of which additionally requires values $\{-5, 5\}$. Github: https://github.com/gexahedron/unit-vector-flows

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikolay Ulyanov. 2026-03-24. Graph Puzzles II.1: Counterexamples to Jain's Second Unit Vector Flows Conjecture. https://arxiv.org/abs/2603.23328

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO