A counting lemma and multiple combinatorial Stokes' theorem
type: Item
instance of: scholarly article
title: A counting lemma and multiple combinatorial Stokes' theorem
zbMATH Open document ID: 0921.05038
author: K. Appert
published in: European Journal of Combinatorics
publication date: 1999-09-29T00:00:00Z
review text: 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.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1248171
zbMATH Keywords: counting lemma
zbMATH Keywords: bipartite digraphs
zbMATH Keywords: multiple combinatorial Stokes' theorem
MaRDI profile type: Publication
OpenAlex ID: W2049049453
Wikidata QID: Q124986940
DOI: 10.1006/EUJC.1998.0247
description: scientific article; zbMATH DE number 1248171