A counting lemma and multiple combinatorial Stokes' theorem
In attempting to give a common generalization of the Sperner lemma and of the Tucker lemma, \textit{K. Fan} [J. Comb. Theory 2, 588-602 (1967; Zbl 0149.41302)] proved a more general form of the combinatorial Stokes' theorem. However, his formula is only concerned with a single labeling. In the present paper, by using a counting lemma related to bipartite digraphs, the authors prove a multiple combinatorial Stokes' theorem.
scientific article; zbMATH DE number 1248171