Threshold hypergraphs
Threshold graphs were introduced by \textit{V. Chvátal} and \textit{P. L. Hammer} [Ann. Discrete Math. 1, 145-162 (1977; Zbl 0384.90091)]. They gave three equivalent characterizations of these graphs. These characterizations were generalized for hypergraphs by \textit{M. Ch. Golumbic} [Combinatorics, Keszthely 1976, Colloq. Math. János Bolyai 18, 419-428 (1978; Zbl 0398.05058)]. He asked whether these were equivalent or not. The answer is negative. The authors prove this by some constructions, and give three equivalent characterizations of the most general definition from the above three generalizations. On the end of this clear style paper we can find a result on the complexity of this property.
- Threshold graphs
- Threshold graphs and related topics
- Threshold Dimension of Graphs
- Quasi-threshold graphs
- Hypergraphs with zero chromatic threshold
- On the Chromatic Thresholds of Hypergraphs
- scientific article; zbMATH DE number 2218519
- Hamiltonian threshold graphs
- The threshold dimension of a graph
- Thresholds for classes of intersection graphs
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3618209 (Why is no real title available?)
- On an extension of Dijkstra's semaphore primitives
- Hamiltonian threshold graphs
- Dualization of regular Boolean functions
- Some complexity results about threshold graphs
- On the characterization of weighted simple games
- On the enumeration of Boolean functions with distinguished variables
- Some results on multithreshold graphs
- Decomposing 1-Sperner hypergraphs
- Minkowski complexes and convex threshold dimension
- Threshold graphs, shifted complexes, and graphical complexes
- On weights and quotas for weighted majority voting games
- Separable and equatable hypergraphs
- Threshold graphs
- scientific article; zbMATH DE number 436445 (Why is no real title available?)
- Some approaches for solving the general (t,k)-design existence problem and other related problems
- scientific article; zbMATH DE number 7378386 (Why is no real title available?)
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
- Multithreshold graphs
- Linear separation of connected dominating sets in graphs
- scientific article; zbMATH DE number 2191976 (Why is no real title available?)
- Multidimension: a dimensionality extension of simple games
- Distinguishing threshold of graphs
- Threshold graphs maximise homomorphism densities
- Note on complexity of computing the domination of binary systems
- Chain and threshold hypergraphs
- Shifted and threshold matroids
- On the independence polynomial and threshold of an antiregular k-hypergraph
- Spectral properties of k -uniform threshold hypergraphs
- Forms of representation for simple games: sizes, conversions and equivalences
- On shift stable hypergraphs
This page was built for publication: Threshold hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057879)
