A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A "signed graph" is a graph Γ where the edges are assigned sign labels, either "+" or "-". The sign of a cycle is the product of the signs of its edges. Let SpecC(Γ) denote the list of lengths of cycles in Γ. We equip each signed graph with a vector whose entries are the numbers of negative k-cycles for k∈SpecC(Γ). These vectors generate a subspace of R^SpecC(Γ). Using matchings with a strong permutability property, we provide lower bounds on the dimension of this space; in particular, we showarXiv:1706.09041v1 fatcat:iwmaippnxbdx7myazpnhhy7czu