{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:36:49Z","timestamp":1723012609112},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1007\/bf01300127","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T06:09:49Z","timestamp":1111730989000},"page":"59-85","source":"Crossref","is-referenced-by-count":10,"title":["Graphs of small dimensions"],"prefix":"10.1007","volume":"16","author":[{"given":"Nancy","family":"Eaton","sequence":"first","affiliation":[]},{"given":"Vojt?ch","family":"R\ufffddl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02579381","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon: Covering graphs by the minimum number of equivalence relations.Combinatorica,6 (3) (1986), 201?206.","journal-title":"Combinatorica"},{"key":"CR2","unstructured":"M. S. Chung, andD. B. West: Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique, to appear."},{"key":"CR3","unstructured":"N. Eaton, R. Gould, andV. R\ufffddl: Onp-intersection representations, to appear."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd?s","year":"1966","unstructured":"P. Erd?s, A.W. Goodman, andL. P\ufffdsa: The representation of a graph by set intersections,Canad. J. of Math. 18 (1966), 106?112.","journal-title":"Canad. J. of Math."},{"key":"CR5","unstructured":"P. Erd?s andL. Lov\ufffdsz: Problems and results on 4-chromatic hypergraphs and some related questions, In:Colloquia Mathematica Societatis J\ufffdnos Bolyai, 10. Infinite and Finite Sets, Vol. II., North-Holland Publishing, 1975."},{"key":"CR6","unstructured":"Z. F\ufffdredi: A random representation of the complete bipartite graph, to appear."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00403406","volume":"3","author":"Z. F\ufffdredi","year":"1986","unstructured":"Z. F\ufffdredi, andJ. Kahn: On the dimensions of ordered sets of bounded degree,Order,3 (1986), 15?20.","journal-title":"Order"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding, Probability inequalities for sums of bounded random variables.J. of the Amer. Math. Stat. Assoc. 58 (1963), 13?30.","journal-title":"J. of the Amer. Math. Stat. Assoc."},{"key":"CR9","unstructured":"M. S. Jacobson, A. E. K\ufffdzdy, andD. B. West: The 2-intersection number of paths and bounded-degree trees, to appear."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(80)90043-X","volume":"29","author":"L. Lov\ufffdsz","year":"1980","unstructured":"L. Lov\ufffdsz, J. Ne?et?il, andA. Pultr: On a product dimension of graphs,J. of Combin. Theory, Ser. B,29 (1980), 47?67.","journal-title":"J. of Combin. Theory, Ser. B"},{"issue":"1","key":"CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0095-8956(92)90006-J","volume":"56","author":"T. Luczak","year":"1992","unstructured":"T. Luczak, A. Ruci?ski, andB. Voigt: Ramsey properties of random graphs,J. of Combin. Theory, Ser. B,56 (1), (1992), 66.","journal-title":"J. of Combin. Theory, Ser. B"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(78)90186-3","volume":"23","author":"J. Ne?et?il","year":"1978","unstructured":"J. Ne?et?il, andV. R\ufffddl: A simple proof of the Galvin-Ramsey Property of the class of all finite graphs and a dimension of a graph,Discrete Mathematics,23 (1978), 49?55.","journal-title":"Discrete Mathematics"},{"issue":"105","key":"CR13","first-page":"475","volume":"30","author":"S. Poljak","year":"1980","unstructured":"S. Poljak, andV. R\ufffddl: Orthogonal partitions and covering of graphs,Czechoslovak Mathematical Journal,30 (105), (1980), 475?485.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"CR14","unstructured":"J. Reitman, V. R\ufffddl, andE. ?i?ajov\ufffd: On embedding of graphs into Euclidean Spaces of small dimension,J. of Combin. Theory, Ser. B 54 (1992)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300127\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:16Z","timestamp":1556647696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01300127"],"URL":"https:\/\/doi.org\/10.1007\/bf01300127","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}