{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:45:12Z","timestamp":1780386312431,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0012-365x(96)00300-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"255-261","source":"Crossref","is-referenced-by-count":25,"title":["Independent transversals in r-partite graphs"],"prefix":"10.1016","volume":"176","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00300-7_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.3240030102","article-title":"The strong chromatic number of a graph","volume":"3","author":"Alon","year":"1992","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00300-7_BIB2","series-title":"The Probabilistic Method","author":"Alon","year":"1991"},{"key":"10.1016\/S0012-365X(96)00300-7_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An algorithmic approach to the Lov\u00e1sz local lemma","volume":"2","author":"Beck","year":"1991","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0012-365X(96)00300-7_BIB4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(96)00300-7_BIB5","first-page":"343","article-title":"Complete subgraphs of chromatic graphs and hypergraphs","volume":"6","author":"Bollob\u00e1s","year":"1974","journal-title":"Utilitas Math."},{"key":"10.1016\/S0012-365X(96)00300-7_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(75)90011-4","article-title":"On complete subgraphs of r-chromatic graphs","volume":"13","author":"Bollob\u00e1s","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00300-7_BIB7","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1215\/S0012-7094-55-02268-7","article-title":"Graphs and matching theorems","volume":"22","author":"Ore","year":"1955","journal-title":"Duke Math. J."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:29:23Z","timestamp":1556116163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0012365X96003007"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00300-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}