Binary set systems and totally balanced hypergraphs

Abstract : We show in this paper that totally balanced hypergraphs (hypergraphs which do not contain special cycles) are exactly hypergraphs that are embeddable into closed hypergraphs for which each vertex admits at most two sons (so called binary hypergraphs). To prove this result we exhibit an efficient algorithm which can produce any binary hypergraph and adapt it to binarize a given totally balanced hypergraph. This result gives, like Lehel[9], a constructive characterization of totally balanced hypergraph.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02436247
Contributor : Pascal Préa <>
Submitted on : Sunday, January 12, 2020 - 8:40:57 PM
Last modification on : Wednesday, January 15, 2020 - 1:43:25 AM

File

binary_hypergraphs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02436247, version 1

Collections

Citation

François Brucker, Pascal Préa, Célia Châtel. Binary set systems and totally balanced hypergraphs. 2020. ⟨hal-02436247⟩

Share

Metrics

Record views

32

Files downloads

6