{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T18:24:11Z","timestamp":1765045451210},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00493-017-3638-4","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T10:14:11Z","timestamp":1502705651000},"page":"1129-1148","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Sparsity and Dimension"],"prefix":"10.1007","volume":"38","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[]},{"given":"Veit","family":"Wiechert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"3638_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11083-015-9359-7","volume":"33","author":"Cs. Bir\u00f3","year":"2016","unstructured":"Cs. Bir\u00f3, M. T. Keller and S. J. Young: Posets with cover graph of pathwidth two have bounded dimension, Order 33 (2016), 195\u2013212.","journal-title":"Order"},{"key":"3638_CR2","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"P. Chalermsook","year":"2012","unstructured":"P. Chalermsook, B. Laekhanukit and D. 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, 1557\u20131576. SIAM, Philadelphia, PA, 2012."},{"key":"3638_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2014.07.005","volume":"110","author":"V. Dujmovi\u0107","year":"2015","unstructured":"V. Dujmovi\u0107: Graph layouts via layered separators, J. Combin. Theory Ser. B 110 (2015), 79\u201389.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3638_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.46298\/dmtcs.346","volume":"7","author":"V. Dujmovi\u0107","year":"2005","unstructured":"V. Dujmovi\u0107 and D. R. Wood: Stacks, queues and tracks: layouts of graph subdivisions, Discrete Math. Theor. Comput. Sci. 7 (2005), 155\u2013201.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"3638_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"B. Dushnik and E. W. Miller: Partially ordered sets, Amer. J. Math. 63 (1941), 600\u2013610.","journal-title":"Amer. J. Math."},{"key":"3638_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00044-X","volume":"92","author":"H. Enomoto","year":"1999","unstructured":"H. Enomoto, M. Sh. Miyauchi and K. Ota: Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph, Discrete Appl. Math. 92 (1999), 149\u2013155.","journal-title":"Discrete Appl. Math."},{"key":"3638_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"D. Eppstein: Diameter and treewidth in minor-closed graph families, Algorithmica 27 (2000), 275\u2013291.","journal-title":"Algorithmica"},{"key":"3638_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006429830221","volume":"17","author":"S. Felsner","year":"2000","unstructured":"S. Felsner and W. T. Trotter: Dimension, graph and hypergraph coloring, Order 17 (2000), 167\u2013177.","journal-title":"Order"},{"key":"3638_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s00373-014-1430-4","volume":"31","author":"S. Felsner","year":"2015","unstructured":"S. Felsner, W. T. Trotter and V. Wiechert: The Dimension of Posets with Planar Cover Graphs, Graphs Combin. 31 (2015), 927\u2013939.","journal-title":"Graphs Combin."},{"key":"3638_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00403406","volume":"3","author":"Z. F\u00fcredi","year":"1986","unstructured":"Z. F\u00fcredi and J. Kahn: On the dimensions of ordered sets of bounded degree, Order 3 (1986), 15\u201320.","journal-title":"Order"},{"key":"3638_CR11","volume-title":"33nd International Conference on Foundations of Software Technology and Theoretical Computer Science","author":"M. Grohe","year":"2013","unstructured":"M. Grohe, S. Kreutzer and S. Siebertz: Characterisations of nowhere dense graphs, in: 33nd International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 24 of LIPIcs. Leibniz Int. Proc. Inform., 21\u201340. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2013."},{"key":"3638_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00493-014-3081-8","volume":"36","author":"G. Joret","year":"2016","unstructured":"G. Joret, P. Micek, K. G. Milans, W. T. Trotter, B. Walczak and R. Wang: Tree-width and dimension, Combinatorica 36 (2016), 431\u2013450.","journal-title":"Combinatorica"},{"key":"3638_CR13","doi-asserted-by":"crossref","unstructured":"G. Joret, P. Micek, W. T. Trotter, R. Wang and V. Wiechert: On the dimension of posets with cover graphs of treewidth 2, Order, to appear","DOI":"10.1007\/s11083-016-9395-y"},{"key":"3638_CR14","volume-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201916","author":"G. Joret","year":"2016","unstructured":"G. Joret, P. Micek and V. Wiechert: Sparsity and dimension, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201916, 1804\u20131813. SIAM, 2016."},{"key":"3638_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(81)90203-X","volume":"35","author":"D. Kelly","year":"1981","unstructured":"D. Kelly: On the dimension of partially ordered sets, Discrete Math. 35 (1981), 135\u2013156.","journal-title":"Discrete Math."},{"key":"3638_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs, Combinatorica 8 (1988), 261\u2013277.","journal-title":"Combinatorica"},{"key":"3638_CR17","unstructured":"P. Micek and V. Wiechert: Topological minors of cover graphs and dimension, Submitted, arXiv:1504.07388."},{"key":"3638_CR18","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"J. Ne\u0161et\u0159il and P. O. de Mendez: Grad and classes with bounded expansion. I. Decompositions, European J. Combin. 29 (2008), 760\u2013776.","journal-title":"European J. Combin."},{"key":"3638_CR19","doi-asserted-by":"publisher","first-page":"868","DOI":"10.2178\/jsl\/1278682204","volume":"75","author":"J. Ne\u0161et\u0159il","year":"2010","unstructured":"J. Ne\u0161et\u0159il and P. O. de Mendez: First order properties on nowhere dense structures, J. Symbolic Logic 75 (2010), 868\u2013887.","journal-title":"J. Symbolic Logic"},{"key":"3638_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"J. Ne\u0161et\u0159il","year":"2012","unstructured":"J. Ne\u0161et\u0159il and P. O. de Mendez: Sparsity, volume 28 of Algorithms and Combinatorics, Springer, Heidelberg, 2012, Graphs, structures, and algorithms."},{"key":"3638_CR21","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.ejc.2011.09.008","volume":"33","author":"J. Ne\u0161et\u0159il","year":"2012","unstructured":"J. Ne\u0161et\u0159il, P. O. de Mendez and D. R. Wood: Characterisations and examples of graph classes with bounded expansion, European J. Combin. 33 (2012), 350\u2013373.","journal-title":"European J. Combin."},{"key":"3638_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"J. Pach and G. T\u00f3th: Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427\u2013439.","journal-title":"Combinatorica"},{"key":"3638_CR23","unstructured":"F. Reidl, F. S. Villaamil and K. Stavropoulos: Characterising bounded expansion by neighbourhood complexity, arXiv:1603.09532."},{"key":"3638_CR24","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ejc.2013.06.017","volume":"35","author":"N. Streib","year":"2014","unstructured":"N. Streib and W. T. Trotter: Dimension and height for posets with planar cover graphs, European J. Combin. 35 (2014), 474\u2013489.","journal-title":"European J. Combin."},{"key":"3638_CR25","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and partially ordered sets","author":"W. T. Trotter","year":"1992","unstructured":"W. T. Trotter: Combinatorics and partially ordered sets, Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, 1992, Dimension theory."},{"key":"3638_CR26","volume-title":"Handbook of combinatorics","author":"W. T. Trotter","year":"1995","unstructured":"W. T. Trotter: Partially ordered sets, in: Handbook of combinatorics, Vol. 1, 2, 433\u2013480. Elsevier Sci. B. V., Amsterdam, 1995."},{"key":"3638_CR27","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","volume":"22","author":"W. T. Trotter Jr.","year":"1977","unstructured":"W. T. Trotter, Jr. and J. I. Moore, Jr,: The dimension of planar posets, J. Combinatorial Theory Ser. B 22 (1977), 54\u201367.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3638_CR28","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jctb.2016.09.001","volume":"122","author":"B. Walczak","year":"2017","unstructured":"B. Walczak: Minors and dimension, J. Combin. Theory Ser. B 122 (2017), 668\u2013689.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3638_CR29","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"M. Yannakakis: The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Methods 3 (1982), 351\u2013358.","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3638-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3638-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3638-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T01:48:49Z","timestamp":1692928129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3638-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["3638"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3638-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,14]]}}}