Improved bounds for the coefficient of flow polynomials
Tingzeng Wu, Shuang Ma, Hong-Jian Lai

TL;DR
This paper improves bounds on the coefficients of flow polynomials for certain graphs and explores properties of graphs with real flow roots, providing tighter inequalities and specific cases.
Contribution
It refines existing bounds for flow polynomial coefficients and establishes new inequalities for graphs with real flow roots, especially for cubic graphs.
Findings
New upper bounds for coefficients when m ≤ n+3 and m ≥ n+4.
Comparison of coefficients for graphs with real flow roots.
Specific bounds for simple connected bridgeless cubic graphs.
Abstract
Let be a connected bridgeless -graph which may have loops and multiedges, and let denote the flow polynomial of . Dong and Koh \cite{Dong1} established an upper bound for the absolute value of coefficient of in the expansion of , where . In this paper, we refine the aforementioned bound. Specifically, we demonstrate that when , , where is the coefficient of in the expansion ; and when , , with being the coefficient of in the expansion . Furthermore, we prove that if is a connected bridgeless cubic graph having only real flow roots, then , where is the coefficient of in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Advanced Optimization Algorithms Research · Functional Equations Stability Results
