Cited By
View all- Joret GMicek PWiechert V(2018)Sparsity and DimensionCombinatorica10.1007/s00493-017-3638-438:5(1129-1148)Online publication date: 1-Oct-2018
Sparsity and dimension
Pages 1804 - 1813
Abstract
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Nešetřil and Ossona de Mendez as a model for sparsity in graphs, is a property that is naturally satisfied by a wide range of graph classes, from graph structure theory (graphs excluding a minor or a topological minor) to graph drawing (e.g. graphs with constant book thickness). Therefore, our theorem generalizes a number of results including the most recent one for posets of bounded height with cover graphs excluding a fixed graph as a topological minor (Walczak, SODA 2015). We also show that the result is in a sense best possible, as it does not extend to nowhere dense classes; in fact, it already fails for cover graphs with locally bounded treewidth.
References
[1]
Csaba Biró, Mitchel T. Keller, and Stephen J. Young. Posets with cover graph of pathwidth two have bounded dimension. arXiv:1308.4877.
[2]
Parinya Chalermsook, Bundit Laekhanukit, and Danupon Nanongkai. Graph products revisited: tight approximation hardness of induced matching, poset dimension and more. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1557--1576. SIAM, Philadelphia, PA, 2012.
[3]
Vida Dujmović. Graph layouts via layered separators. J. Combin. Theory Ser. B, 110:79--89, 2015. arXiv:1302.0304.
[4]
Vida Dujmović and David R. Wood. Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci., 7(1):155--201, 2005.
[5]
Ben Dushnik and Edwin W. Miller. Partially ordered sets. Amer. J. Math., 63:600--610, 1941.
[6]
Hikoe Enomoto, Miki Shimabara Miyauchi, and Katsuhiro Ota. Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. Discrete Appl. Math., 92(2-3):149--155, 1999.
[7]
David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3-4):275--291, 2000. arXiv:math/9907126.
[8]
Stefan Felsner, William T. Trotter, and Veit Wiechert. The Dimension of Posets with Planar Cover Graphs. Graphs Combin., 31(4):927--939, 2015.
[9]
Zoltan Füredi and Jeff Kahn. On the dimensions of ordered sets of bounded degree. Order, 3(1):15--20, 1986.
[10]
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, and Ruidong Wang. Tree-width and dimension. Combinatorica, to appear. arXiv:1301.5271.
[11]
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, and Veit Wiechert. On the dimension of posets with cover graphs of treewidth 2. Submitted, arXiv:1406.3397.
[12]
Gwenaël Joret, Piotr Micek, and Veit Wiechert. Sparsity and dimension. arXiv:1507.01120.
[13]
David Kelly. On the dimension of partially ordered sets. Discrete Math., 35:135--156, 1981.
[14]
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8(3):261--277, 1988.
[15]
Piotr Micek and Veit Wiechert. Topological minors of cover graphs and dimension. submitted, arXiv:1504.07388.
[16]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion. I. Decompositions. European J. Combin., 29(3):760--776, 2008. arXiv:math/0508323.
[17]
Jaroslav Nešetřil and Patrice Ossona de Mendez. First order properties on nowhere dense structures. J. Symbolic Logic, 75(3):868--887, 2010.
[18]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity, volume 28 of Algorithms and Combinatorics. Springer, Heidelberg, 2012. Graphs, structures, and algorithms.
[19]
Jaroslav Nešetřil, Patrice Ossona de Mendez, and David R. Wood. Characterisations and examples of graph classes with bounded expansion. European J. Combin., 33(3):350--373, 2012. arXiv:0902.3265.
[20]
Jaroslav Nešetřil, Patrice Ossona de Mendez, and David R. Wood. Characterisations and examples of graph classes with bounded expansion. European J. Combin., 33(3):350--373, 2012.
[21]
János Pach and Géza Tóth. Graphs drawn with few crossings per edge. Combinatorica, 17(3):427--439, 1997.
[22]
Noah Streib and William T. Trotter. Dimension and height for posets with planar cover graphs. European J. Combin., 35:474--489, 2014.
[23]
William T. Trotter. Partially ordered sets. In Handbook of combinatorics, Vol. 1, 2, pages 433--480. Elsevier Sci. B. V., Amsterdam, 1995.
[24]
William T. Trotter, Jr. and John I. Moore, Jr. The dimension of planar posets. J. Combinatorial Theory Ser. B, 22(1):54--67, 1977.
[25]
Bartosz Walczak. Minors and dimension. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pages 1698--1707, 2015. arXiv:1407.4066.
[26]
Mihalis Yannakakis. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods, 3(3):351--358, 1982.
- Sparsity and dimension
Recommendations
Sparsity and Dimension
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Nešetřil and Ossona de Mendez as a model for sparsity in graphs, is a property that is ...
The Induced Separation Dimension of a Graph
A linear ordering of the vertices of a graph Gseparates two edges of G if both the endpoints of one precede both the endpoints of the other in the order. We call two edges $$\{a,b\}$${a,b} and $$\{c,d\}$${c,d} of Gstrongly independent if the set of ...
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Let D=(V(D),A(D)) be a digraph. The competition graph of D, is the graph with vertex set V(D) and edge set {uv@?V(D)2:@?w@?V(D),uw@?,vw@?@?A(D)}. The double competition graph of D, is the graph with vertex set V(D) and edge set {uv@?V(D)2:@?w"1,w"2@?V(D)...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIAM Activity Group on Discrete Mathematics
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 10 January 2016
Check for updates
Qualifiers
- Research-article
Conference
SODA '16
Sponsor:
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 70Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
Cited By
View all- Joret GMicek PWiechert V(2018)Sparsity and DimensionCombinatorica10.1007/s00493-017-3638-438:5(1129-1148)Online publication date: 1-Oct-2018
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in