Flows on Simplicial Complexes
Combinatorics
2013-10-07 v1
Abstract
Given a graph , the number of nowhere-zero -flows is known to be a polynomial in . We extend the definition of nowhere-zero -flows to simplicial complexes of dimension greater than one, and prove the polynomiality of the corresponding function for certain and certain subclasses of simplicial complexes.
Keywords
Cite
@article{arxiv.1206.2260,
title = {Flows on Simplicial Complexes},
author = {Matthias Beck and Yvonne Kemper},
journal= {arXiv preprint arXiv:1206.2260},
year = {2013}
}
Comments
10 pages, to appear in Discrete Mathematics and Theoretical Computer Science (proceedings of FPSAC'12)