2025/02/18 by Wu, Tingzeng, Ma, Shuang, Lai, Hong-Jian
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2502.12773
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 \citeDong1 established an upper bound for the absolute value of coefficient ci of ti 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, |ci|\leqslant di, where di is the coefficient of ti in the expansion ∏j=1m-n+1(t+j); and when m\geqslant n+4, |ci|\leqslant di, with di being the coefficient of ti 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 bi\leqslant |ci|, where bi is the coefficient of ti in the expansion (t+1)(t+2)(n)/(2). Notably, if G is simple connected bridgeless cubic graph with only real flow roots, then bi is the coefficient of ti in the expansion (t+1)(t+2)(n)/(2)-2(t+3)2.