{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:22:26Z","timestamp":1648560146445},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T00:00:00Z","timestamp":1382572800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p>For any <jats:italic>c<\/jats:italic> \u2265 2, a <jats:italic>c-strong colouring<\/jats:italic> of the hypergraph <jats:italic>G<\/jats:italic> is an assignment of colours to the vertices of <jats:italic>G<\/jats:italic> such that, for every edge <jats:italic>e<\/jats:italic> of <jats:italic>G<\/jats:italic>, the vertices of <jats:italic>e<\/jats:italic> are coloured by at least min{<jats:italic>c<\/jats:italic>,|<jats:italic>e<\/jats:italic>|} distinct colours. The hypergraph <jats:italic>G<\/jats:italic> is <jats:italic>t-intersecting<\/jats:italic> if every two edges of <jats:italic>G<\/jats:italic> have at least <jats:italic>t<\/jats:italic> vertices in common.<\/jats:p><jats:p>A natural variant of a question of Erd\u0151s and Lov\u00e1sz is: For fixed <jats:italic>c<\/jats:italic> \u2265 2 and <jats:italic>t<\/jats:italic> \u2265 1, what is the minimum number of colours that is sufficient to <jats:italic>c<\/jats:italic>-strong colour any <jats:italic>t<\/jats:italic>-intersecting hypergraphs? The purpose of this note is to describe some open problems related to this question.<\/jats:p>","DOI":"10.1017\/s0963548313000515","type":"journal-article","created":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T10:44:55Z","timestamp":1382611495000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Semi-Strong Colouring of Intersecting Hypergraphs"],"prefix":"10.1017","volume":"23","author":[{"given":"ERIC","family":"BLAIS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AMIT","family":"WEINSTEIN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YUICHI","family":"YOSHIDA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"key":"S0963548313000515_ref2","first-page":"551","volume-title":"Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science: FOCS","author":"Blais","year":"2012"},{"key":"S0963548313000515_ref4","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"S0963548313000515_ref8","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"key":"S0963548313000515_ref5","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions.","volume":"10","author":"Erd\u0151s","year":"1973","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"S0963548313000515_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2318-9"},{"key":"S0963548313000515_ref7","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032497"},{"key":"S0963548313000515_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39286-3_1"},{"key":"S0963548313000515_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.02.007"},{"key":"S0963548313000515_ref9","volume-title":"Graph Colouring and the Probabilistic Method","author":"Molloy","year":"2001"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548313000515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:12:26Z","timestamp":1555981946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548313000515\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,24]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S0963548313000515"],"URL":"https:\/\/doi.org\/10.1017\/s0963548313000515","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,24]]}}}