Decomposing 1-Sperner hypergraphs
From MaRDI portal
Publication:2315439
zbMath1417.05145arXiv1510.02438MaRDI QIDQ2315439
Martin Milanič, Endre Boros, Vladimir A. Gurvich
Publication date: 5 August 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.02438
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong cliques and equistability of EPT graphs
- On equistable, split, CIS, and related classes of graphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Monotone circuits for monotone weighted threshold functions
- Threshold hypergraphs
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Aggregation of equations in integer programming
- Equistable chordal graphs
- Threshold graphs and related topics
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Equistable simplicial, very well-covered, and line graphs
- Equistable distance-hereditary graphs
- On the composition and decomposition of clutters
- Transformation of integer programs to knapsack problems
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
- Linear Separation of Dominating Sets in Graphs
- Equistable graphs
- On the counting problem for monotone boolean functions
- Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
- Linear separation of connected dominating sets in graphs
- Bottleneck extrema
- Clutter Decomposition and Monotonic Boolean Functions*
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- A note on equivalent systems of linear diophantine equations
This page was built for publication: Decomposing 1-Sperner hypergraphs
