Search arXivSearch

arXiv · 2502.12773

Improved bounds for the coefficient of flow polynomials

Abstract

Let $G$ be a connected bridgeless $(n,m)$-graph which may have loops and multiedges, and let $F(G,t)$ denote the flow polynomial of $G$. Dong and Koh \cite{Dong1} established an upper bound for the absolute value of coefficient $c_{i}$ of $t^{i}$ in the expansion of $F(G,t)$, where $0\leqslant i \leqslant m-n+1$. In this paper, we refine the aforementioned bound. Specifically, we demonstrate that when $n \leqslant m \leqslant n+3$, $|c_{i}|\leqslant d_{i}$, where $d_{i}$ is the coefficient of $t^{i}$ in the expansion $\prod\limits_{j=1}^{m-n+1}(t+j)$; and when $m\geqslant n+4$, $|c_{i}|\leqslant d_{i}$, with $d_{i}$ being the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)(t+3)^{2}(t+4)^{m-n-3}$. Furthermore, we prove that if $G$ is a connected bridgeless cubic graph having only real flow roots, then $b_{i}\leqslant |c_{i}|$, where $b_{i}$ is the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)^{\frac{n}{2}}$. Notably, if $G$ is simple connected bridgeless cubic graph with only real flow roots, then $b_{i}$ is the coefficient of $t^{i}$ in the expansion $(t+1)(t+2)^{\frac{n}{2}-2}(t+3)^{2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tingzeng Wu, Shuang Ma, Hong-Jian Lai. 2025-02-18. Improved bounds for the coefficient of flow polynomials. https://arxiv.org/abs/2502.12773

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO