{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:22:21Z","timestamp":1783984941241,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00493-019-4084-2","type":"journal-article","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T11:03:58Z","timestamp":1588071838000},"page":"363-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On a Conjecture of Erd\u0151s on Locally Sparse Steiner Triple Systems"],"prefix":"10.1007","volume":"40","author":[{"given":"Stefan","family":"Glock","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniela","family":"K\u00fchn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Allan","family":"Lo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,28]]},"reference":[{"key":"4084_CR1","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, 3rd ed., Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley & Sons, 2008."},{"key":"4084_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1002\/rsa.20667","volume":"49","author":"P Bennett","year":"2016","unstructured":"P. Bennett and T. Bohman: A note on the random greedy independent set algorithm, Random Structures Algorithms49 (2016), 479\u2013502.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.aim.2015.04.015","volume":"280","author":"T Bohman","year":"2015","unstructured":"T. Bohman, A. Frieze and E. Lubetzky: Random triangle removal, Adv. Math.280 (2015), 379\u2013438.","journal-title":"Adv. Math."},{"key":"4084_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00222-010-0247-x","volume":"181","author":"T Bohman","year":"2010","unstructured":"T. Bohman and P. Keevash: The early evolution of the H-free process, Invent. Math.181 (2010), 291\u2013336.","journal-title":"Invent. Math."},{"key":"4084_CR5","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1112\/jlms.12242","volume":"100","author":"T Bohman","year":"2019","unstructured":"T. Bohman and L. Warnke: Large girth approximate Steiner triple systems, J. Lond. Math. Soc.100 (2019), 895\u2013913.","journal-title":"J. Lond. Math. Soc."},{"key":"4084_CR6","unstructured":"A. E. Brouwer: Steiner triple systems without forbidden subconfigurations, Mathematisch Centrum Amsterdam, Tech. Report ZW 104\/77, 1977."},{"key":"4084_CR7","doi-asserted-by":"crossref","unstructured":"D. Ellis and N. Linial: On regular hypergraphs of high girth, Electron. J. Combin.21 (2014), Art. 1.54.","DOI":"10.37236\/3851"},{"key":"4084_CR8","unstructured":"P. Erd\u0151s: Problems and results in combinatorial analysis, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Accad. Naz. Lincei, 1976, 3\u201317."},{"key":"4084_CR9","unstructured":"P. Erd\u0151s: Problems and results in combinatorial analysis, Creation in Math.9 (1976)."},{"key":"4084_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jcta.2006.04.003","volume":"114","author":"A D Forbes","year":"2007","unstructured":"A. D. Forbes, M. J. Grannell and T. S. Griggs: On 6-sparse Steiner triple systems, J. Combin. Theory Ser. A114 (2007), 235\u2013252.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4084_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1214\/aop\/1176996452","volume":"3","author":"D A Freedman","year":"1975","unstructured":"D. A. Freedman: On tail probabilities for martingales, Ann. Probab.3 (1975), 100\u2013118.","journal-title":"Ann. Probab."},{"key":"4084_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.aim.2013.03.009","volume":"240","author":"Z F\u00fcredi","year":"2013","unstructured":"Z. F\u00fcredi and M. Ruszink\u00f3: Uniform hypergraphs containing no grids, Adv. Math.240 (2013), 302\u2013324.","journal-title":"Adv. Math."},{"key":"4084_CR13","unstructured":"S. Glock, D. K\u00fchn, A. Lo and D. Osthus: The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F, Memoirs Amer. Math. Soc. (to appear)"},{"key":"4084_CR14","doi-asserted-by":"crossref","unstructured":"D. A. Grable: On random greedy triangle packing, Electron. J. Combin.4 (1997), Art. 11.","DOI":"10.37236\/1296"},{"key":"4084_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1002\/1520-6610(2000)8:4<300::AID-JCD7>3.0.CO;2-R","volume":"8","author":"M J Grannell","year":"2000","unstructured":"M. J. Grannell, T. S. Griggs and C. A. Whitehead: The resolution of the anti-Pasch conjecture, J. Combin. Des.8 (2000), 300\u2013309.","journal-title":"J. Combin. Des."},{"key":"4084_CR16","first-page":"79","volume":"15","author":"T S Griggs","year":"1990","unstructured":"T. S. Griggs, J. Murphy and J. S. Phelan: Anti-Pasch Steiner triple systems, J. Comb. Inf. Syst. Sci.15 (1990), 79\u201384.","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"4084_CR17","unstructured":"P. Keevash: The existence of designs, arXiv:1401.3665 (2014)."},{"key":"4084_CR18","doi-asserted-by":"publisher","first-page":"903","DOI":"10.4171\/JEMS\/779","volume":"20","author":"P Keevash","year":"2018","unstructured":"P. Keevash: Counting designs, J. Eur. Math. Soc.20 (2018), 903\u2013927.","journal-title":"J. Eur. Math. Soc."},{"key":"4084_CR19","first-page":"191","volume":"2","author":"T P Kirkman","year":"1847","unstructured":"T. P. Kirkman: On a problem in combinatorics, Cambridge Dublin Math. J.2 (1847), 191\u2013204.","journal-title":"Cambridge Dublin Math. J."},{"key":"4084_CR20","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1002\/rsa.20814","volume":"53","author":"M Krivelevich","year":"2018","unstructured":"M. Krivelevich, M. Kwan, P.-S. Loh and B. Sudakov: The random k-matching-free process, Random Structures Algorithms53 (2018), 692\u2013716.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR21","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/15M1050343","volume":"30","author":"D K\u00fchn","year":"2016","unstructured":"D. K\u00fchn, D. Osthus and A. Taylor: On the random greedy F-free hypergraph process, SIAM J. Discrete Math.30 (2016), 1343\u20131350.","journal-title":"SIAM J. Discrete Math."},{"key":"4084_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/jcd.3180010506","volume":"1","author":"H Lefmann","year":"1993","unstructured":"H. Lefmann, K. T. Phelps and V. R\u00f6dl: Extremal problems for triple systems, J. Combin. Des.1 (1993), 379\u2013394.","journal-title":"J. Combin. Des."},{"key":"4084_CR23","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024610700008838","volume":"61","author":"A C H Ling","year":"2000","unstructured":"A. C. H. Ling, C. J. Colbourn, M. J. Grannell and T. S. Griggs: Construction techniques for anti-Pasch Steiner triple systems, J. Lond. Math. Soc.61 (2000), 641\u2013657.","journal-title":"J. Lond. Math. Soc."},{"key":"4084_CR24","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/rsa.20487","volume":"43","author":"N Linial","year":"2013","unstructured":"N. Linial and Z. Luria: An upper bound on the number of Steiner triple systems, Random Structures Algorithms43 (2013), 399\u2013406.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T","volume":"18","author":"D Osthus","year":"2001","unstructured":"D. Osthus and A. Taraz: Random maximal H-free graphs, Random Structures Algorithms18 (2001), 61\u201382.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0097-3165(89)90074-5","volume":"51","author":"N Pippenger","year":"1989","unstructured":"N. Pippenger and J. Spencer: Asymptotic behaviour of the chromatic index for hypergraphs, J. Combin. Theory Ser. A51 (1989), 24\u201342.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4084_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<161::AID-RSA1>3.0.CO;2-W","volume":"8","author":"V R\u00f6dl","year":"1996","unstructured":"V. R\u00f6dl and L. Thoma: Asymptotic packing and the random greedy algorithm, Random Structures Algorithms8 (1996), 161\u2013177.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR28","first-page":"939","volume":"18","author":"I Z Ruzsa","year":"1978","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di: Triple systems with no six points carrying three triangles, Combinatorics II, Colloq. Math. Soc. J\u00e1nos Bolyai 18, North-Holland, 1978, 939\u2013945.","journal-title":"Combinatorics II, Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"4084_CR29","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/rsa.3240070206","volume":"7","author":"J Spencer","year":"1995","unstructured":"J. Spencer: Asymptotic packing via a branching process, Random Structures Algorithms7 (1995), 167\u2013172.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR30","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/rsa.20468","volume":"44","author":"L Warnke","year":"2014","unstructured":"L. Warnke: The C\u2113-free process, Random Structures Algorithms44 (2014), 490\u2013526.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR31","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/rsa.20444","volume":"44","author":"L Warnke","year":"2014","unstructured":"L. Warnke: When does the K4-free process stop?, Random Structures Algorithms44 (2014), 355\u2013397.","journal-title":"Random Structures Algorithms"},{"key":"4084_CR32","doi-asserted-by":"crossref","unstructured":"A. Wolfe: 5-sparse Steiner triple systems of order n exist for almost all admissible n, Electron. J. Combin.12 (2005), Art. 68.","DOI":"10.37236\/1965"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4084-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-019-4084-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4084-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T23:54:44Z","timestamp":1619567684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-019-4084-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,28]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4084"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-4084-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,28]]},"assertion":[{"value":"26 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}