{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:37:07Z","timestamp":1648636627118},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2011,4,13]],"date-time":"2011-04-13T00:00:00Z","timestamp":1302652800000},"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":[[2011,7]]},"abstract":"<jats:p>We develop lower bounds on the Hadwiger number <jats:italic>h<\/jats:italic>(<jats:italic>G<\/jats:italic>) of graphs <jats:italic>G<\/jats:italic> with high chromatic number. In particular, if <jats:italic>G<\/jats:italic> has <jats:italic>n<\/jats:italic> vertices and chromatic number <jats:italic>k<\/jats:italic> then <jats:italic>h<\/jats:italic>(<jats:italic>G<\/jats:italic>) \u2265 (4<jats:italic>k<\/jats:italic> \u2212 <jats:italic>n<\/jats:italic>)\/3.<\/jats:p>","DOI":"10.1017\/s0963548311000174","type":"journal-article","created":{"date-parts":[[2011,4,13]],"date-time":"2011-04-13T04:40:16Z","timestamp":1302669616000},"page":"513-518","source":"Crossref","is-referenced-by-count":1,"title":["Minors in Graphs with High Chromatic Number"],"prefix":"10.1017","volume":"20","author":[{"given":"THOMAS","family":"B\u00d6HME","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDR","family":"KOSTOCHKA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDREW","family":"THOMASON","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,4,13]]},"reference":[{"key":"S0963548311000174_ref2","first-page":"71","volume-title":"Graph Theory","author":"Duchet","year":"1982"},{"key":"S0963548311000174_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202354"},{"key":"S0963548311000174_ref3","first-page":"373","article-title":"Kritische Graphen II.","volume":"8","author":"Gallai","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"S0963548311000174_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00069-8"},{"key":"S0963548311000174_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20268"},{"key":"S0963548311000174_ref5","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1206"},{"key":"S0963548311000174_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01361708"},{"key":"S0963548311000174_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:57:23Z","timestamp":1556337443000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000174\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,13]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S0963548311000174"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000174","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,13]]}}}