Separable and equatable hypergraphs

DOI10.1016/j.dam.2023.03.019OpenAlexW4327905048MaRDI QIDQ2696627

Shmuel Onn, Daniel Deza

Publication date: 17 April 2023

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

Full work available at URL: https://arxiv.org/abs/2206.07517

zbMATH Keywords

hypergraphcombinatorial optimizationmatroidBoolean functionthreshold graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold hypergraphs
• A characterization of threshold matroids
• Threshold graphs and related topics
• A condition for matchability in hypergraphs
• On null 3-hypergraphs
• Matching orderable and separable hypergraphs
• On the asymptotic proportion of connected matroids
• Optimization over Degree Sequences
• Oriented Matroids

This page was built for publication: Separable and equatable hypergraphs