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 the normal view instead:
scientific article; zbMATH DE number 3926959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8073241114616394
0 references
0.7868966460227966
0 references
0.7862029671669006
0 references
0.7454159259796143
0 references
