Combinatorial Stokes formulae

DOI10.1016/j.ejc.2006.07.010zbMath1130.05050OpenAlexW2050931196MaRDI QIDQ2462340

Frédéric Meunier

Publication date: 30 November 2007

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.07.010

zbMATH Keywords

triangulationlabellingsimplicial complexsimplex

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal set theory (05D05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

A new coloring theorem of Kneser graphs, Spectra of combinatorial Laplace operators on simplicial complexes, The chromatic number of almost stable Kneser hypergraphs, Combinatorial Stokes formulas via minimal resolutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equilibrium in a discrete exchange economy with money
• A constructive proof of a permutation-based generalization of Sperner's lemma
• A counting lemma and multiple combinatorial Stokes' theorem
• Generalized Kneser coloring theorems with combinatorial proofs
• A combinatorical proof of Kneser's conjecture
• A generalization of Tucker's combinatorial lemma with topological applications
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation