A Counting Lemma and Multiple Combinator
โ
Shyh-Nan Lee; Mau-Hsiang Shih
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 150 KB
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.