Some Bounds on the Threshold Dimension of Graphs

Abstract

The threshold dimension of a graph G is the minimum number of threshold graphs whose intersection yields G. We give tight or nearly tight upper bounds for the threshold dimension of a graph in terms of various graph parameters including treewidth, maximum degree, degeneracy, number of vertices, and vertex cover number. We also study threshold dimension of random graphs and graphs with high girth.