Binary set systems and totally balanced hypergraphs (Q2661224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hypergraphs with no special cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak hierarchies associated with similarity measures - An additive clustering technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems and dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown-free lattices and their related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Formal Context Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of totally balanced hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices with Doubly Irreducible Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank

Revision as of 21:56, 24 July 2024

scientific article
Language Label Description Also known as
English
Binary set systems and totally balanced hypergraphs
scientific article

    Statements

    Binary set systems and totally balanced hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2021
    0 references
    hypergraphs
    0 references
    totally balanced hypergraphs
    0 references
    binary hypergraphs
    0 references
    clustering models
    0 references

    Identifiers