A characterization of totally balanced hypergraphs (Q1066918): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:08, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of totally balanced hypergraphs |
scientific article |
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
