{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:29:01Z","timestamp":1768735741881,"version":"3.49.0"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T00:00:00Z","timestamp":1500422400000},"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":[[2018,1]]},"abstract":"<jats:p>We prove \u03c7\u2032<jats:sub><jats:italic>s<\/jats:italic><\/jats:sub>(<jats:italic>G<\/jats:italic>) \u2264 1.93 \u0394(<jats:italic>G<\/jats:italic>)<jats:sup>2<\/jats:sup> for graphs of sufficiently large maximum degree where \u03c7\u2032<jats:sub><jats:italic>s<\/jats:italic><\/jats:sub>(<jats:italic>G<\/jats:italic>) is the strong chromatic index of <jats:italic>G<\/jats:italic>. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where we are allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable.<\/jats:p>","DOI":"10.1017\/s0963548317000244","type":"journal-article","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T03:23:07Z","timestamp":1500434587000},"page":"21-43","source":"Crossref","is-referenced-by-count":34,"title":["A Stronger Bound for the Strong Chromatic Index"],"prefix":"10.1017","volume":"27","author":[{"given":"HENNING","family":"BRUHN","sequence":"first","affiliation":[]},{"given":"FELIX","family":"JOOS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2017,7,19]]},"reference":[{"key":"S0963548317000244_ref20","first-page":"148","volume-title":"Surveys in Combinatorics","author":"McDiarmid","year":"1989"},{"key":"S0963548317000244_ref18","unstructured":"Kutin S. (2002) Extensions to McDiarmid's inequality when differences are bounded with high probability. Technical Report TR-2002-04, University of Chicago."},{"key":"S0963548317000244_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58575-3"},{"key":"S0963548317000244_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0"},{"key":"S0963548317000244_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90144-7"},{"key":"S0963548317000244_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02699376"},{"key":"S0963548317000244_ref22","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1724"},{"key":"S0963548317000244_ref29","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000103"},{"key":"S0963548317000244_ref3","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1178243286"},{"key":"S0963548317000244_ref11","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170204"},{"key":"S0963548317000244_ref4","unstructured":"Bonamy M. , Perrett T. and Postle L. (2016) Reed's conjecture and strong edge coloring. Paper given at Scottish Combinatorics Meeting, Glasgow."},{"key":"S0963548317000244_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.03.053"},{"key":"S0963548317000244_ref13","doi-asserted-by":"publisher","DOI":"10.1137\/140986980"},{"key":"S0963548317000244_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548313000473"},{"key":"S0963548317000244_ref14","doi-asserted-by":"publisher","DOI":"10.1137\/130944424"},{"key":"S0963548317000244_ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1910"},{"key":"S0963548317000244_ref9","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"29","author":"Faudree","year":"1990","journal-title":"Ars Combin."},{"key":"S0963548317000244_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90163-5"},{"key":"S0963548317000244_ref12","doi-asserted-by":"publisher","DOI":"10.1137\/16M1058078"},{"key":"S0963548317000244_ref19","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<357::AID-RSA9>3.0.CO;2-Y"},{"key":"S0963548317000244_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009820"},{"key":"S0963548317000244_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(02)00037-4"},{"key":"S0963548317000244_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6"},{"key":"S0963548317000244_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301005089"},{"key":"S0963548317000244_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003246"},{"key":"S0963548317000244_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001528"},{"key":"S0963548317000244_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070014"},{"key":"S0963548317000244_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.01.003"},{"key":"S0963548317000244_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90678-9"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548317000244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T16:48:40Z","timestamp":1555346920000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548317000244\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,19]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["S0963548317000244"],"URL":"https:\/\/doi.org\/10.1017\/s0963548317000244","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,19]]}}}