The Euler formula of cyclomatic numbers of hypergraphs (Q1377369)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Euler formula of cyclomatic numbers of hypergraphs |
scientific article; zbMATH DE number 1112719
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Euler formula of cyclomatic numbers of hypergraphs |
scientific article; zbMATH DE number 1112719 |
Statements
The Euler formula of cyclomatic numbers of hypergraphs (English)
0 references
28 October 1998
0 references
The author studies the semilattice generated by the intersection closure of a given hypergraph. He shows that both cycles and cycle classes of a hypergraph can be characterized by the structure of the associated semilattice, and that both the number of cycles and the number of cycle classes satisfy the Euler formula. He also shows that these cyclomatic numbes are related to the Möbius function of posets.
0 references
hypergraph
0 references
acyclic hypergrph
0 references
semilattice
0 references
poset
0 references
Euler formula
0 references
Graham reduction
0 references
