Abstract

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 structural description of totally balanced hypergraphs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call