{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:09:42Z","timestamp":1771610982019,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf02122693","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T15:44:43Z","timestamp":1126712683000},"page":"27-40","source":"Crossref","is-referenced-by-count":66,"title":["Entropy splitting for antiblocking corners and perfect graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"I.","family":"Csisz\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"K\u00f6rner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Marton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Simonyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02122693_CR1","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1976","unstructured":"C. Berge:Graphs and hypergraphs, 2nd edition. North Holland, Amsterdam,1976.","edition":"2nd edition"},{"key":"BF02122693_CR2","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal: On certain polytopes associated with graphs.J. Comb. Theory B,18 (1975) 138\u2013154.","journal-title":"J. Comb. Theory B"},{"key":"BF02122693_CR3","volume-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1982","unstructured":"I. Csisz\u00e1r andJ. K\u00f6rner:Information Theory. Coding Theorems for Discrete Memoryless Systems. Academic Press, New York,1982."},{"key":"BF02122693_CR4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D. R. Fulkerson","year":"1971","unstructured":"D. R. Fulkerson: Blocking and anti-blocking pairs of polyhedra,Math. Programming,1 (1971), 168\u2013194.","journal-title":"Math. Programming"},{"key":"BF02122693_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","volume-title":"Mathematical Programming","author":"D. R. Fulkerson","year":"1973","unstructured":"D. R. Fulkerson: On the perfect graph theorem. In:Mathematical Programming (T. C. Hu, S. M. Robinson, Eds), Academic Press, New York,1973, 69\u201377."},{"key":"BF02122693_CR6","doi-asserted-by":"crossref","unstructured":"M.Gr\u00f6tschel, L.Lov\u00e1sz and A.Schrljver: Relaxations of vertex packing.J. Comb. Theory B,40 (86) 330\u2013343.","DOI":"10.1016\/0095-8956(86)90087-0"},{"key":"BF02122693_CR7","first-page":"411","volume-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"J. K\u00f6rner","year":"1973","unstructured":"J. K\u00f6rner: Coding of an information source having ambiguous alphabet and the entropy of graphs. In:Transactions of the 6 th Prague Conference on Information Theory, etc., Academia, Prague,1973, 411\u2013425."},{"key":"BF02122693_CR8","unstructured":"J.K\u00f6rner: An extension of the class of perfect graphs,Studia Sci. Math. Hung.,8 (73) 405\u2013409."},{"key":"BF02122693_CR9","doi-asserted-by":"crossref","unstructured":"J.K\u00f6rner: Fredman-Koml\u00f3s bounds and information theory,SIAM J. of Algebraic and Discrete Methods,7 (86) 560\u2013570.","DOI":"10.1137\/0607062"},{"key":"BF02122693_CR10","doi-asserted-by":"crossref","unstructured":"J.K\u00f6rner and G.Longo: Two-step encoding of finite memoryless sources,IEEE Trans. on Inform. Theory,19 (73) 778\u2013782.","DOI":"10.1109\/TIT.1973.1055109"},{"key":"BF02122693_CR11","doi-asserted-by":"crossref","unstructured":"J.K\u00f6rner and K.Marton: New bounds for perfect hashing via information theory,European J. of Combinatorics, to appear.","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"BF02122693_CR12","doi-asserted-by":"crossref","unstructured":"J.K\u00f6rner and K.Marton: Graphs that split entropy,SIAM J. on Discrete Mathematics, to appear.","DOI":"10.1137\/0401008"},{"key":"BF02122693_CR13","unstructured":"J.K\u00f6rner and A.Sgarro: A new approach to rate distorsion theory,Rend. Inst. Matem. Univ. di Trieste 18 (86), 117\u2013187."},{"key":"BF02122693_CR14","doi-asserted-by":"crossref","unstructured":"L.Lov\u00e1sz: On the Shannon capacity of a graph.,IEEE Trans. on Inform. Theory,25 (79) 1\u20137.","DOI":"10.1109\/TIT.1979.1055985"},{"key":"BF02122693_CR15","first-page":"55","volume-title":"More Selected Topics in Graph Theory","author":"L. Lov\u00e1sz","year":"1983","unstructured":"L. Lov\u00e1sz: Perfect graphs. In:More Selected Topics in Graph Theory (L. W. Beineke, R. J. Wilson eds), Academic Press, New York-London,1983, 55\u201387."},{"key":"BF02122693_CR16","unstructured":"K.Marton: On the Shannon capacity of graphs within a given type;in preparation."},{"key":"BF02122693_CR17","volume-title":"The theory of information and coding","author":"R. J. McEliece","year":"1977","unstructured":"R. J. McEliece:The theory of information and coding, Addison-Wesley, Reading, Mass.1977."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122693\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T12:58:12Z","timestamp":1586437092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF02122693"],"URL":"https:\/\/doi.org\/10.1007\/bf02122693","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}