A counting lemma and multiple combinatorial stokes' theorem

Abstract

We prove in the present paper a counting lemma for bipartite digraphs which is useful in the combinatorics of pseudomanifolds. By an application of the lemma, we prove a multiple combinatorial Stokes' theorem, generalizing the 1967 Ky Fan combinatorial formula to multiple labelings. © 1998 Academic Press.