A counting lemma and multiple combinatorial Stokes' theorem (Q1277318)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A counting lemma and multiple combinatorial Stokes' theorem |
scientific article; zbMATH DE number 1248171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counting lemma and multiple combinatorial Stokes' theorem |
scientific article; zbMATH DE number 1248171 |
Statements
A counting lemma and multiple combinatorial Stokes' theorem (English)
0 references
29 September 1999
0 references
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.
0 references
counting lemma
0 references
bipartite digraphs
0 references
multiple combinatorial Stokes' theorem
0 references
