Binary set systems and totally balanced hypergraphs

DOI10.1016/j.dam.2021.02.030OpenAlexW3002015628MaRDI QIDQ2661224

Célia Châtel, Pascal Préa, François Brucker

Publication date: 1 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.030

zbMATH Keywords

hypergraphstotally balanced hypergraphsclustering modelsbinary hypergraphs

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with no special cycles
• Crown-free lattices and their related graphs
• A characterization of totally balanced hypergraphs
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Efficient graph representations
• Set systems and dissimilarities
• Lattices with Doubly Irreducible Elements
• Totally Balanced Formal Context Representation

This page was built for publication: Binary set systems and totally balanced hypergraphs