Bounds on Threshold Dimension and Disjoint Threshold Coverings

DOI10.1137/0608012zbMath0626.05045OpenAlexW2164793044WikidataQ105709500 ScholiaQ105709500MaRDI QIDQ3029042

Yechezkel Zalcstein, Edward T. Ordman, Paul Erdős

Publication date: 1987

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0608012

zbMATH Keywords

coveringsgraph partitionthreshold graphsthreshold dimensionthreshold covering numberthreshold partitions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On Universal Threshold Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph Theory and Probability. II
• The Complexity of the Partial Order Dimension Problem
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Threshold Numbers and Threshold Completions

This page was built for publication: Bounds on Threshold Dimension and Disjoint Threshold Coverings