A characterization of totally balanced hypergraphs (Q1066918)
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: A characterization of totally balanced hypergraphs |
scientific article; zbMATH DE number 3926959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of totally balanced hypergraphs |
scientific article; zbMATH DE number 3926959 |
Statements
A characterization of totally balanced hypergraphs (English)
0 references
1985
0 references
In this paper, totally balanced hypergraphs are viewed as special tree- hypergraphs. Theorem 3.4 immediately implies the following result due to Anstee: every totally balanced hypergraph on n vertices can be completed by new edges to a totally balanced simple hypergraph with maximal number of edges in which the number of k-element edges, \(1\leq k\leq n\), is equal to \(n-k+1\).
0 references
totally balanced hypergraphs
0 references
tree-hypergraphs
0 references
