{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:18:11Z","timestamp":1758824291607},"reference-count":6,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2012,3,21]],"date-time":"2012-03-21T00:00:00Z","timestamp":1332288000000},"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":[[2012,7]]},"abstract":"<jats:p>Scott conjectured in [6] that the class of graphs with no induced subdivision of a given graph is \u03c7-bounded. We verify his conjecture for maximal triangle-free graphs.<\/jats:p>","DOI":"10.1017\/s0963548312000065","type":"journal-article","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T21:36:04Z","timestamp":1332452164000},"page":"512-514","source":"Crossref","is-referenced-by-count":3,"title":["Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs"],"prefix":"10.1017","volume":"21","author":[{"given":"NICOLAS","family":"BOUSQUET","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ST\u00c9PHAN","family":"THOMASS\u00c9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2012,3,21]]},"reference":[{"key":"S0963548312000065_ref6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-J"},{"key":"S0963548312000065_ref3","first-page":"413","article-title":"Problems from the world surrounding perfect graphs.","volume":"XIX","author":"Gy\u00e1rf\u00e1s","year":"1987","journal-title":"Zastos. Mat."},{"key":"S0963548312000065_ref1","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0188"},{"key":"S0963548312000065_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305948"},{"key":"S0963548312000065_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01364272"},{"key":"S0963548312000065_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070302"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548312000065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T19:47:35Z","timestamp":1556221655000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548312000065\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,21]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0963548312000065"],"URL":"https:\/\/doi.org\/10.1017\/s0963548312000065","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,21]]}}}