The following pages link to Threshold hypergraphs (Q1057879):
Displaying 17 items.
- Some approaches for solving the general (\(t,k\))-design existence problem and other related problems (Q385139) (← links)
- Note on complexity of computing the domination of binary systems (Q678860) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- On shift stable hypergraphs (Q923104) (← links)
- Dualization of regular Boolean functions (Q1084376) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- On the enumeration of Boolean functions with distinguished variables (Q2100402) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- Minkowski complexes and convex threshold dimension (Q2363363) (← links)
- Threshold graphs, shifted complexes, and graphical complexes (Q2455583) (← links)
- On weights and quotas for weighted majority voting games (Q2669142) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- (Q3139894) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Multidimension: a dimensionality extension of simple games (Q6060715) (← links)
- Threshold graphs maximise homomorphism densities (Q6632807) (← links)
