{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:28:47Z","timestamp":1764570527393},"reference-count":53,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T00:00:00Z","timestamp":1383523200000},"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>We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.<\/jats:p>","DOI":"10.1017\/s0963548313000448","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T11:02:33Z","timestamp":1383562953000},"page":"8-28","source":"Crossref","is-referenced-by-count":20,"title":["Short Proofs of Some Extremal Results"],"prefix":"10.1017","volume":"23","author":[{"given":"DAVID","family":"CONLON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JACOB","family":"FOX","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BENNY","family":"SUDAKOV","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,11,4]]},"reference":[{"key":"S0963548313000448_ref35","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1268"},{"key":"S0963548313000448_ref23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","article-title":"Density theorems for bipartite graphs and related Ramsey-type results.","volume":"29","author":"Fox","year":"2009","journal-title":"Combinatorica"},{"key":"S0963548313000448_ref32","first-page":"87","article-title":"An improved bound on the largest induced forests for triangle-free planar graphs.","volume":"12","author":"Kowalik","year":"2010","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S0963548313000448_ref39","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"S0963548313000448_ref40","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"S0963548313000448_ref42","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070305"},{"key":"S0963548313000448_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009620"},{"key":"S0963548313000448_ref34","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070204"},{"key":"S0963548313000448_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.090"},{"key":"S0963548313000448_ref7","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20118"},{"key":"S0963548313000448_ref50","first-page":"317","article-title":"Clique partitions of the complement of a one-factor.","volume":"46","author":"Wallis","year":"1985","journal-title":"Congr. Numer."},{"key":"S0963548313000448_ref51","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/111\/1079751"},{"key":"S0963548313000448_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2626-3"},{"key":"S0963548313000448_ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-09-00645-6"},{"key":"S0963548313000448_ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1999.2973"},{"key":"S0963548313000448_ref49","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20327"},{"key":"S0963548313000448_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2264-1"},{"key":"S0963548313000448_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(85)90071-8"},{"key":"S0963548313000448_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788541"},{"key":"S0963548313000448_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.04.041"},{"key":"S0963548313000448_ref45","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20035"},{"key":"S0963548313000448_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990174"},{"key":"S0963548313000448_ref22","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1962-060-4"},{"key":"S0963548313000448_ref15","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/bds097"},{"key":"S0963548313000448_ref43","doi-asserted-by":"crossref","unstructured":"Skokan J. and Stein M. Cycles are strongly Ramsey-unsaturated. Combin. Probab. Comput., to appear.","DOI":"10.1017\/S0963548314000212"},{"key":"S0963548313000448_ref6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.1028"},{"key":"S0963548313000448_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-006-0642-7"},{"key":"S0963548313000448_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF03352998"},{"key":"S0963548313000448_ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1999.2389"},{"key":"S0963548313000448_ref52","first-page":"18","volume-title":"Combinatorics: Proc. NATO Advanced Study Inst., Breukelen, 1974","author":"Wilson","year":"1974"},{"key":"S0963548313000448_ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001243"},{"key":"S0963548313000448_ref8","first-page":"51","volume-title":"Combinatorics: Paul Erd\u0151s is Eighty","author":"Beck","year":"1993"},{"key":"S0963548313000448_ref36","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009632"},{"key":"S0963548313000448_ref17","unstructured":"Dudek A. and Mubayi D. On generalized Ramsey numbers for 3-uniform hypergraphs. J. Graph Theory. Preprint."},{"key":"S0963548313000448_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6610(1996)4:2<83::AID-JCD1>3.0.CO;2-V"},{"key":"S0963548313000448_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2011.01.005"},{"key":"S0963548313000448_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90173-1"},{"key":"S0963548313000448_ref14","doi-asserted-by":"publisher","DOI":"10.1137\/090749220"},{"key":"S0963548313000448_ref26","doi-asserted-by":"crossref","first-page":"#57","DOI":"10.37236\/1810","article-title":"On-line Ramsey theory","volume":"11","author":"Grytczuk","year":"2004","journal-title":"Electron. J. Combin."},{"key":"S0963548313000448_ref2","unstructured":"Albertson M. and Haas R. (1998) A problem raised at the DIMACS Graph Coloring Week."},{"key":"S0963548313000448_ref21","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.417"},{"key":"S0963548313000448_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF00053695"},{"key":"S0963548313000448_ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0029-3"},{"key":"S0963548313000448_ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894569"},{"key":"S0963548313000448_ref53","doi-asserted-by":"crossref","unstructured":"Wolfovitz G. K 4-free graphs without large induced triangle-free subgraphs. Combinatorica, to appear.","DOI":"10.1007\/s00493-013-2845-x"},{"key":"S0963548313000448_ref30","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1515\/crll.1892.110.104","article-title":"\u00dcber die Irreduzibilit\u00e4t ganzer rationaler Funktionen mit ganzzahligen Koeffizienten.","volume":"110","author":"Hilbert","year":"1892","journal-title":"J. Reine Angew. Math."},{"key":"S0963548313000448_ref20","first-page":"181","article-title":"On the minimal number of vertices representing the edges of a graph.","volume":"6","author":"Erd\u0151s","year":"1961","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"S0963548313000448_ref10","doi-asserted-by":"crossref","first-page":"#136","DOI":"10.37236\/623","article-title":"On-line Ramsey theory for bounded degree graphs","volume":"18","author":"Butterfield","year":"2011","journal-title":"Electron. J. Combin."},{"key":"S0963548313000448_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00227-9"},{"key":"S0963548313000448_ref18","unstructured":"Dudek A. , Retter T. and R\u00f6dl V. On generalized Ramsey numbers of Erd\u0151s and Rogers. Preprint."},{"key":"S0963548313000448_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2011.02.004"},{"key":"S0963548313000448_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005881"},{"key":"S0963548313000448_ref48","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2009.169.595"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548313000448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T02:40:41Z","timestamp":1688611241000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548313000448\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,4]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S0963548313000448"],"URL":"https:\/\/doi.org\/10.1017\/s0963548313000448","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,4]]}}}