On the number of B-flows of a graph

Authors:
Delia Garijo;Andrew Goodall;Jaroslav Nešetřil
Affiliations:
-;-;-
Venue:
European Journal of Combinatorics
Year:
2014

Citing 3
Cited 0

Limits of dense graph sequences

Journal of Combinatorial Theory Series B
Contractors and connectors of graph algebras

Journal of Graph Theory
Graph invariants in the spin model

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exhibit explicit constructions of contractors for the graph parameter counting the number of B-flows of a graph, where B is a subset of a finite Abelian group closed under inverses. These constructions are of great interest because of their relevance to the family of B-flow conjectures formulated by Tutte, Fulkerson, Jaeger, and others.