A counting lemma and multiple combinatorial Stokes' theorem

DOI10.1006/eujc.1998.0247zbMath0921.05038OpenAlexW2049049453WikidataQ124986940 ScholiaQ124986940MaRDI QIDQ1277318

K. Appert

Publication date: 29 September 1999

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b8dd2c0f04f498b5bad47a42ea21296acfab4940

zbMATH Keywords

counting lemmabipartite digraphsmultiple combinatorial Stokes' theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Combinatorial Stokes formulae ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications

This page was built for publication: A counting lemma and multiple combinatorial Stokes' theorem