A characterization of totally balanced h
β
JenΓΆ Lehel
π
Article
π
1985
π
Elsevier Science
π
English
β 418 KB
A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru