• Aucun résultat trouvé

Binary set systems and totally balanced hypergraphs

N/A
N/A
Protected

Academic year: 2021

Partager "Binary set systems and totally balanced hypergraphs"

Copied!
19
0
0

Texte intégral

Figure

Figure 1: Two runs of Algorithm 1 on the same graph, with the same edge xy chosen. In both cases, as x is the only neighbor of y, y will be suppressed at Line 14 of the for loop.
Figure 3: The binary hypergraph obtained by the sequence of mixed trees of Figure 2 represented as a lattice.
Figure 4: A totally balanced hypergraph, subhypergraph of the binary one of Figure 3, and a sequence of mixed trees which constructs this hypergraph.

Références

Documents relatifs