Generalized Dehn-Sommerville relations for hypergraphs
Combinatorics
2017-04-25 v2
Abstract
The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf algebra of hypergraphs. We characterize a wide class of eulerian hypergraphs according to the combinatorics of underlying clutters. The analogous results hold for simplicial complexes by the isomorphism which is induced from the correspondence of clutters and simplicial complexes.
Cite
@article{arxiv.1402.0421,
title = {Generalized Dehn-Sommerville relations for hypergraphs},
author = {Vladimir Grujic and Tanja Stojadinovic and Dusko Jojic},
journal= {arXiv preprint arXiv:1402.0421},
year = {2017}
}
Comments
13 pages; changes in the statement and proof of Theorem 3.8 and Theorem 3.10; Proposition 3.3 and Lemma 3.9 are removed; Proposition 3.11 is added; minor changes elsewhere