Abstract
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. © 1998 Academic Press.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Lee, S. N., & Shih, M. H. (1998). A counting lemma and multiple combinatorial stokes’ theorem. European Journal of Combinatorics, 19(8), 969–979. https://doi.org/10.1006/eujc.1998.0247
Readers over time
Readers' Seniority
Readers' Discipline
