Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
Pages 244 - 256
Abstract
A graph G on n vertices is a threshold graph if there exist real numbers and b such that the zero-one solutions of the linear inequality are the characteristic vectors of the cliques of G. Introduced in [Aggregation of inequalities in integer programming. Chvátal and Hammer, Annals of Discrete Mathematics, 1977], the threshold dimension of a graph G, denoted by, is the minimum number of threshold graphs whose intersection yields G. Given a graph G on n vertices, in line with Chvátal and Hammer, is the Boolean function that has the property that if and only if x is the characteristic vector of a clique in G. A Boolean function f for which there exists a graph G such that is called a graphic Boolean function. It follows that for a graph G, is precisely the minimum number of majority gates whose AND (or conjunction) realizes the graphic Boolean function . The fact that there exist Boolean functions which can be realized as the AND of only exponentially many majority gates motivates us to study threshold dimension of graphs. We give tight or nearly tight upper bounds for the threshold dimension of a graph in terms of its treewidth, maximum degree, degeneracy, number of vertices, size of a minimum vertex cover, etc. We also study threshold dimension of random graphs and graphs with high girth.
References
[1]
Adiga A, Bhowmick D, and Chandran LS The hardness of approximating the boxicity, cubicity and threshold dimension of a graph Discrete Appl. Math. 2010 158 16 1719-1726
[2]
Adiga A, Chandran LS, and Mathew R Cubicity, degeneracy, and crossing number Eur. J. Comb. 2014 35 2-12
[3]
Bollobás B Random graphs 2001 Cambridge Cambridge University Press
[4]
Chacko D and Francis MC Representing graphs as the intersection of cographs and threshold graphs Electron. J. Comb. 2021 28 3 P3.11
[5]
Chandran LS, Francis MC, and Sivadasan N Geometric representation of graphs in low dimension using axis parallel boxes Algorithmica 2010 56 2 129-140
[6]
Chandran LS and Sivadasan N Boxicity and treewidth J. Combinatorial Theory Ser. B 2007 97 5 733-744
[7]
Chvátal V and Hammer PL Aggregation of inequalities in integer programming Ann. Discrete Math. 1977 1 145-162
[8]
Conlon, D.: A new upper bound for diagonal Ramsey numbers. Ann. Math. 941–960, (2009)
[9]
Erdős P, Kierstead HA, and Trotter WT The dimension of random ordered sets Random Struct. Algorithms 1991 2 3 253-275
[10]
Esperet L and Wiechert V Boxicity, poset dimension, and excluded minors Electron. J. Comb. 2018 25 4 P4.51
[11]
Francis, M.C., Majumder, A., Mathew, R.: Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates (2022). https://arxiv.org/abs/2202.12325
[12]
Golumbic MC Algorithmic Graph Theory and Perfect Graphs 2004 Amsterdam Elsevier
[13]
Hammer PL and Mahadev NV Bithreshold graphs SIAM J. Algebraic Discrete Methods 1985 6 3 497-506
[14]
Korach E and Solel N Tree-width, path-width, and cutwidth Discret. Appl. Math. 1993 43 1 97-101
[15]
Kratochvíl J A special planar satisfiability problem and a consequence of its NP-completeness Discret. Appl. Math. 1994 52 233-252
[16]
Kratochvíl J and Tuza Z Intersection dimensions of graph classes Graphs Comb. 1994 10 2–4 159-168
[17]
Mahadev NV and Peled UN Threshold Graphs and Related Topics 1995 Amsterdam Elsevier
[18]
Mahajan M Depth-2 threshold circuits Resonance 2019 24 3 371-380
[19]
Majumder, A., Mathew, R.: Local boxicity and maximum degree (2021). https://arxiv.org/abs/1810.02963
[20]
Raschle, T., Simon, K.: Recognition of graphs with threshold dimension two. In Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of computing, pp. 650–661 (1995)
[21]
Roberts, F.S.: Recent Progresses in Combinatorics, chapter On the boxicity and cubicity of a graph, pp. 301–310. Academic Press, New York (1969)
[22]
Robertson N and Seymour PD Graph minors. II. algorithmic aspects of tree-width J. Algorithms 1986 7 3 309-322
[23]
Yannakakis M The complexity of the partial order dimension problem SIAM J. Algebraic Discrete Methods 1982 3 3 351-358
Index Terms
- Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
Index terms have been assigned to the content through auto-classification.
Recommendations
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
A k-dimensional box is the Cartesian product R"1xR"2x...xR"k where each R"i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a ...
Pathwidth and searching in parameterized threshold graphs
WALCOM'10: Proceedings of the 4th international conference on Algorithms and ComputationTreewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized chordal and threshold graphs. We define a chordal+1v graph as a graph ...
Structural Parameterizations for Boxicity
The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dimensional boxes. Boxicity, the problem of deciding whether a given graph G has boxicity at most d, is NP-complete for every fixed $$d \ge 2$$d 2. ...
Comments
Information & Contributors
Information
Published In
Jun 2022
468 pages
© Springer Nature Switzerland AG 2022.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 22 June 2022
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025