𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Counting Lemma and Multiple Combinatorial Stokes' Theorem

✍ Scribed by Shyh-Nan Lee; Mau-Hsiang Shih

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
150 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

A Vertex-Splitting Lemma, de Werra's The
A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings
✍ A.J.W. Hilton; D.S.G. Stirling; T. Slivnik πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 418 KB

We prove a new vertex-splitting lemma which states that if a multigraph G has maximum multiplicity of at most p, then each vertex u can be split into W(d(u)Γ‚p)X new vertices, w(d(u)Γ‚p)x of degree p, with the multiple edges being shared out between the new vertices in such a way that each multiple ed