{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T02:18:30Z","timestamp":1772504310153,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00493-020-4324-5","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T14:04:40Z","timestamp":1630418680000},"page":"873-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Probabilistic Refinement of the Asymptotic Spectrum of Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"P\u00e9ter","family":"Vrana","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"4324_CR1","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.412676","volume":"41","author":"N Alon","year":"1995","unstructured":"N. Alon and A. Orlitsky: Repeated communication and Ramsey graphs, IEEE Transactions on Information Theory 41 (1995), 1276\u20131289.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR2","doi-asserted-by":"publisher","first-page":"8127","DOI":"10.1088\/1751-8113\/40\/28\/S18","volume":"40","author":"K M R Audenaert","year":"2007","unstructured":"K. M. R. Audenaert: A sharp continuity estimate for the von Neumann entropy, Journal of Physics A: Mathematical and Theoretical 40 (2007), 8127.","journal-title":"Journal of Physics A: Mathematical and Theoretical"},{"key":"4324_CR3","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1109\/TIT.2018.2889108","volume":"65","author":"B Bukh","year":"2019","unstructured":"B. Bukh and Ch. Cox: On a fractional version of Haemers\u2019 bound, IEEE Transactions on Information Theory 65 (2019), 3340\u20133348.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR4","unstructured":"A. Blasiak: A graph-theoretic approach to network coding, PhD thesis, Cornell University, 2013. https:\/\/hdl.handle.net\/1813\/34147."},{"key":"4324_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00533715","volume":"57","author":"I Csisz\u00e1r","year":"1981","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner: On the capacity of the arbitrarily varying channel for maximum probability of error, Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete 57 (1981), 87\u2013101.","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"key":"4324_CR6","doi-asserted-by":"crossref","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner: Information theory: coding theorems for discrete memoryless systems. Cambridge University Press, second edition, 2011.","DOI":"10.1017\/CBO9780511921889"},{"key":"4324_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02122693","volume":"10","author":"I Csisz\u00e1r","year":"1990","unstructured":"I. Csisz\u00e1r, J. K\u00f6rner, L. Lov\u00e1sz, K. Martgn and G. Simgnyi: Entropy splitting for antiblocking corners and perfect graphs, Combinatorica 10 (1990), 27\u201340.","journal-title":"Combinatorica"},{"key":"4324_CR8","doi-asserted-by":"publisher","first-page":"7330","DOI":"10.1109\/TIT.2014.2349502","volume":"60","author":"T Cubitt","year":"2014","unstructured":"T. Cubitt, L. Man\u010dinska, D. E. Rgbersgn, S. Severini, D. Stahlke and A. Winter: Bounds on entanglement-assisted source-channel coding via the Lov\u00e1sz \u03d1 number and its variants, IEEE Transactions on Information Theory 60 (2014), 7330\u20137344.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR9","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1017\/S0960129515000444","volume":"27","author":"T Fritz","year":"2017","unstructured":"T. Fritz: Resource convertibility and ordered commutative monoids, Mathematical Structures in Computer Science 27 (2017), 850\u2013938.","journal-title":"Mathematical Structures in Computer Science"},{"key":"4324_CR10","doi-asserted-by":"crossref","unstructured":"T. Fritz: A unified construction of semiring-homomorphic graph invariants, J. Algebr. Comb. (2021).","DOI":"10.1007\/s10801-020-00983-y"},{"key":"4324_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D R Fulkersgn","year":"1971","unstructured":"D. R. Fulkersgn: Blocking and anti-blocking pairs of polyhedra, Mathematical programming 1 (1971), 168\u2013194.","journal-title":"Mathematical programming"},{"key":"4324_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01819779","volume":"6","author":"G Gaszt","year":"1971","unstructured":"G. Gaszt and W. Imrich: On the lexicographic and costrong product of set systems, Aequationes mathematicae 6 (1971), 319\u2013320.","journal-title":"Aequationes mathematicae"},{"key":"4324_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel, L. Lgv\u00e1sz and A. Schrijver: Relaxations of vertex packing, Journal of Combinatorial Theory, Series B 40 (1986), 330\u2013343.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4324_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/jctb.2001.2042","volume":"83","author":"S Gerke","year":"2001","unstructured":"S. Gerke and C. McDiarmid: Graph imperfection, Journal of Combinatorial Theory, Series B 83 (2001), 58\u201378.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4324_CR15","first-page":"267","volume":"25","author":"W Haemers","year":"1978","unstructured":"W. Haemers: An upper bound for the Shannon capacity of a graph, in: Colloq. Math. Soc. J\u00e1nos Bolyai, volume 25, 267\u2013272, 1978.","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"4324_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TIT.1979.1056027","volume":"25","author":"W Haemers","year":"1979","unstructured":"W. Haemers: On some problems of Lov\u00e1sz concerning the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979), 231\u2013232.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR17","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1137\/17M115565X","volume":"32","author":"S Hu","year":"2018","unstructured":"S. Hu, I. Tamo and O. Shayevitz: A bound on the Shannon capacity via a linear programming variation, SIAM Journal on Discrete Mathematics 32 (2018), 2229\u20132241.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4324_CR18","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/TIT.1973.1055109","volume":"19","author":"J K\u00f6rner","year":"1973","unstructured":"J. K\u00f6rner and G. Longo: Two-step encoding for finite sources, IEEE Transactions on Information Theory 19 (1973), 778\u2013782.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/1193","volume":"1","author":"D E Knuth","year":"1994","unstructured":"D. E. Knuth: The sandwich theorem, The Electronic Journal of Combinatorics 1 (1994), 1.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"4324_CR20","unstructured":"J. K\u00f6rner: Coding of an information source having ambiguous alphabet and the entropy of graphs, in: 6th Prague conference on information theory, 411\u2013425, 1973."},{"key":"4324_CR21","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0607062","volume":"7","author":"J K\u00f6rner","year":"1986","unstructured":"J. K\u00f6rner: Fredman-Koml\u00f3s bounds and information theory, SIAM Journal on Algebraic Discrete Methods 7 (1986), 560\u2013570.","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"4324_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01204721","volume":"12","author":"J K\u00f6rner","year":"1992","unstructured":"J. K\u00f6rner, G. Simonyi and Z. Tuza: Perfect couples of graphs, Combinatorica 12 (1992), 179\u2013192.","journal-title":"Combinatorica"},{"key":"4324_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz: Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics 2 (1972), 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"4324_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On the Shannon capacity of a graph, IEEE Transactions on Information theory 25 (1979), 1\u20137.","journal-title":"IEEE Transactions on Information theory"},{"key":"4324_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jctb.1993.1015","volume":"57","author":"K Marton","year":"1993","unstructured":"K. Marton: On the Shannon capacity of probabilistic graphs, Journal of Combinatorial Theory, Series B 57 (1993), 183\u2013195.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4324_CR26","unstructured":"D. Petz: Quantum information theory and quantum statistics, Springer, 2007."},{"key":"4324_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01210984","volume":"76","author":"G Sabidussi","year":"1961","unstructured":"G. Sabidussi: Graph derivatives, Mathematische Zeitschrift 76 (1961), 385\u2013401.","journal-title":"Mathematische Zeitschrift"},{"key":"4324_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"2","author":"C Shannon","year":"1956","unstructured":"C. Shannon: The zero error capacity of a noisy channel, IRE Transactions on Information Theory 2 (1956), 8\u201319.","journal-title":"IRE Transactions on Information Theory"},{"key":"4324_CR29","doi-asserted-by":"crossref","unstructured":"G. Simonyi: Graph entropy: A survey, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 20, 399\u2013441. American Mathematical Society, jun 1995.","DOI":"10.1090\/dimacs\/020\/08"},{"key":"4324_CR30","unstructured":"G. Simonyi: Perfect graphs and graph entropy: An updated survey, Perfect graphs, 293\u2013328, 2001."},{"key":"4324_CR31","first-page":"102","volume":"384","author":"V Strassen","year":"1988","unstructured":"V. Strassen: The asymptotic spectrum of tensors, Journal f\u00fcr die reine und angewandte Mathematik 384 (1988), 102\u2013152.","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"4324_CR32","unstructured":"E. R. Scheinerman and D. H. Ullman: Fractional graph theory: A rational approach to the theory of graphs, 1997."},{"key":"4324_CR33","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TIT.1976.1055607","volume":"22","author":"H Witsenhausen","year":"1976","unstructured":"H. Witsenhausen: The zero-error side information problem and chromatic numbers (corresp.), IEEE Transactions on Information Theory 22 (1976), 592\u2013593.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4324_CR34","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s00493-019-3992-5","volume":"39","author":"J Zuiddam","year":"2019","unstructured":"J. Zuiddam: The asymptotic spectrum of graphs and the Shannon capacity, Combinatorica 39 (2019), 1173\u20131184.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4324-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4324-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4324-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T10:09:44Z","timestamp":1673172584000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4324-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,31]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4324"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4324-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,31]]},"assertion":[{"value":"23 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}