{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T09:10:57Z","timestamp":1693213857659},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"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":["Order"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11083-017-9439-y","type":"journal-article","created":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T05:14:59Z","timestamp":1507958099000},"page":"403-420","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear Extensions and Comparable Pairs in Partial Orders"],"prefix":"10.1007","volume":"35","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Penman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"issue":"2","key":"9439_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0097-3165(89)90028-9","volume":"52","author":"A Bj\u00f6rner","year":"1989","unstructured":"Bj\u00f6rner, A., Wachs, M.L.: q-Hook length formulas for forests. J. Comb. Theory A 52(2), 165\u2013187 (1989)","journal-title":"J. Comb. Theory A"},{"key":"9439_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration inequalities: A nonasymptotic theory of independence. Oxford University Press, Oxford (2013)"},{"issue":"4","key":"9439_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00420352","volume":"9","author":"GR Brightwell","year":"1992","unstructured":"Brightwell, G.R.: Random k-dimensional orders: Width and number of linear extensions. Order 9(4), 333\u2013342 (1992)","journal-title":"Order"},{"key":"9439_CR4","doi-asserted-by":"crossref","unstructured":"Brightwell, G.R.: Models of random partial orders. In: Walker, K. (ed.) Surveys in Combinatorics, London Mathematical Society Lecture Note Series 187, pp. 53-84. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511662089.004"},{"issue":"1-3","key":"9439_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0012-365X(94)90147-3","volume":"125","author":"GR Brightwell","year":"1994","unstructured":"Brightwell, G.R.: Linear extensions of random orders. Discret. Math. 125(1-3), 87\u201396 (1994)","journal-title":"Discret. Math."},{"issue":"2","key":"9439_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0097-3165(96)80001-X","volume":"73","author":"GR Brightwell","year":"1996","unstructured":"Brightwell, G.R., Pr\u00f6mel, H.J., Steger, A.: The average number of linear extensions of a partial order. J. Comb. Theory A 73(2), 193\u2013206 (1996)","journal-title":"J. Comb. Theory A"},{"issue":"4","key":"9439_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/B:ORDE.0000034596.50352.f7","volume":"20","author":"GR Brightwell","year":"2003","unstructured":"Brightwell, G.R., Tetali, P.: The number of linear extensions of the boolean lattice. Order 20(4), 333\u2013345 (2003)","journal-title":"Order"},{"issue":"6","key":"9439_CR8","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s00493-013-2821-5","volume":"33","author":"J Cardinal","year":"2013","unstructured":"Cardinal, J., Fiorini, S., Joret, G., Jungers, R.M., Munro, J.I.: Sorting under partial information (without the ellipsoid algorithm). Combinatorica 33(6), 655\u2013697 (2013)","journal-title":"Combinatorica"},{"issue":"2","key":"9439_CR9","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Comb. Theory B 18(2), 138\u2013154 (1975)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"9439_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02122693","volume":"10","author":"I Csisz\u00e1r","year":"1990","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J., Lov\u00e1sz, L., Marton, K., Simonyi, G.: Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10(1), 27\u201340 (1990)","journal-title":"Combinatorica"},{"issue":"1","key":"9439_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"issue":"1","key":"9439_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00341632","volume":"6","author":"P Edelman","year":"1989","unstructured":"Edelman, P., Hibi, T., Stanley, R.P.: A recurrence for linear extensions. Order 6(1), 15\u201318 (1989)","journal-title":"Order"},{"issue":"2","key":"9439_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(85)90042-1","volume":"55","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval graphs and interval orders. Discret. Math. 55(2), 135\u2013149 (1985)","journal-title":"Discret. Math."},{"issue":"1","key":"9439_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0012-365X(92)90036-F","volume":"103","author":"PC Fishburn","year":"1992","unstructured":"Fishburn, P.C., Trotter, W.T.: Linear extensions of semiorders: A maximization problem. Discret. Math. 103(1), 25\u201340 (1992)","journal-title":"Discret. Math."},{"issue":"4","key":"9439_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M Fredman","year":"1976","unstructured":"Fredman, M.: How good is the information theory bound in sorting?. Theor. Comput. Sci. 1(4), 355\u2013361 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9439_CR16","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1002\/rsa.20083","volume":"27","author":"N Georgiou","year":"2005","unstructured":"Georgiou, N.: The random binary growth model. Random Struct. Algor. 27(4), 520\u2013552 (2005)","journal-title":"Random Struct. Algor."},{"issue":"10","key":"9439_CR17","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1080\/00029890.1990.11995679","volume":"97","author":"J Justicz","year":"1990","unstructured":"Justicz, J., Scheinerman, E., Winkler, P.: Random intervals. Amer. Math. Monthly 97(10), 881\u2013889 (1990)","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"9439_CR18","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1006\/jcss.1995.1077","volume":"51","author":"J Kahn","year":"1995","unstructured":"Kahn, J., Kim, J.H.: Entropy and Sorting. J. Comput. Syst. Sci. 51(3), 390\u2013399 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9439_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","volume":"205","author":"DJ Kleitman","year":"1975","unstructured":"Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of partial orders on a finite set. Trans. Amer. Math. Soc. 205, 205\u2013220 (1975)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9439_CR20","volume-title":"The art of computer programming, volume 3: sorting and searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming, volume 3: sorting and searching, 2nd edn. Addison-Wesley, Boston (1998)","edition":"2nd edn."},{"key":"9439_CR21","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics, London Mathematical Society Lecture Note Series 141, pp. 148-188. Cambridge University Press (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"key":"9439_CR22","volume-title":"Perfect Graphs","author":"JL Ram\u00edrez-Alfons\u00edn","year":"2001","unstructured":"Ram\u00edrez-Alfons\u00edn, J.L., Reed, B.A.: Perfect Graphs. Wiley, New Jersey (2001)"},{"issue":"2-3","key":"9439_CR23","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0012-365X(87)90016-1","volume":"63","author":"J Sha","year":"1987","unstructured":"Sha, J., Kleitman, D.J.: The number of linear extensions of subset ordering. Discret. Math. 63(2-3), 271\u2013279 (1987)","journal-title":"Discret. Math."},{"key":"9439_CR24","unstructured":"Simonyi, G.: Perfect graphs and graph entropy. An updated survey. In: Ram\u00edrez-Alfons\u00edn, J.L., Reed, B. A. (eds.) Perfect Graphs, pp. 293\u2013328. Wiley (2001)"},{"issue":"3","key":"9439_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00563525","volume":"6","author":"G Stachowiak","year":"1989","unstructured":"Stachowiak, G.: A relation between the comparability graph and the number of linear extensions. Order 6(3), 241\u2013244 (1989)","journal-title":"Order"},{"issue":"1","key":"9439_CR26","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187680","volume":"1","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: Two poset polytopes. Discrete Comput. Geom. 1(1), 9\u201323 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9439_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative combinatorics, volume 1","author":"RP Stanley","year":"2011","unstructured":"Stanley, R.P.: Enumerative combinatorics, volume 1, 2nd edn. Cambridge University Press, Cambridge (2011)","edition":"2nd edn."},{"key":"9439_CR28","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and partially ordered sets: dimension theory","author":"WT Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and partially ordered sets: dimension theory. Johns Hopkins University Press, Baltimore (1992)"},{"issue":"2","key":"9439_CR29","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s11083-015-9369-5","volume":"33","author":"WT Trotter","year":"2016","unstructured":"Trotter, W.T., Wang, R.: Planar posets, dimension, breadth and the number of minimal elements. Order 33(2), 333\u2013346 (2016)","journal-title":"Order"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-017-9439-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9439-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T04:43:33Z","timestamp":1693111413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-017-9439-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,14]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["9439"],"URL":"https:\/\/doi.org\/10.1007\/s11083-017-9439-y","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,14]]}}}