加载中…
This article studies real roots of the flow polynomial of a bridgeless graph . For any integer , let be the supremum in such that has no real roots in for all graphs with , where is the set of vertices in of degrees larger than . We prove that can be determined by considering a finite set of graphs and show that for , , and . We also prove that for any bridgeless graph , if all roots of are real but some of these roots are not in the set , then $|E|\ge |V|+17F(G,\lambda)(1,2)$.

生成讲解博客的中文版本

生成AI智能校验的中文版本