{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T05:15:24Z","timestamp":1721711724216},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00493-017-3669-x","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T04:18:26Z","timestamp":1526530706000},"page":"1-36","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Long Cycles have the Edge-Erd\u0151s-P\u00f3sa Property"],"prefix":"10.1007","volume":"39","author":[{"given":"Henning","family":"Bruhn","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Heinlein","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Joos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"3669_CR1","unstructured":"ISGCI, http:\/\/www.graphclasses.org\/smallgraphs.html."},{"key":"3669_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00493-007-0047-0","volume":"27","author":"E. Birmel\u00e9","year":"2007","unstructured":"E. Birmel\u00e9, J. A. Bondy and B. Reed: The Erd\u0151s-P\u00f3sa property for long circuits, Combinatorica 27 (2007), 135\u2013145.","journal-title":"Combinatorica"},{"key":"3669_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.22156","volume":"87","author":"H. Bruhn","year":"2018","unstructured":"H. Bruhn, F. Joos and O. Schaudt: Long cycles through prescribed vertices have the Erd\u0151s-P\u00f3sa property, J. Graph Theory 87 (2018), 275\u2013284.","journal-title":"J. Graph Theory"},{"key":"3669_CR4","first-page":"1","volume-title":"Graph removal lemmas","author":"D. Conlon","year":"2013","unstructured":"D. Conlon and J. Fox: Graph removal lemmas, Surveys in combinatorics 2013, London Math. Soc. Lecture Note Ser., vol. 409, Cambridge Univ. Press, Cambridge, 2013, 1\u201349."},{"key":"3669_CR5","first-page":"195","volume":"52","author":"I. J. Dejter","year":"1987","unstructured":"I. J. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cyclic transversality, Colloq. Math. Soc. J\u00e1nos Bolyai 52 (1987), 195\u2013203.","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"3669_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph theory, fourth ed., Springer, Heidelberg, 2010."},{"key":"3669_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P. Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s and L. P\u00f3sa: On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen 9 (1962), 3\u201312.","journal-title":"Publ. Math. Debrecen"},{"key":"3669_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/jgt.21776","volume":"77","author":"S. Fiorini","year":"2014","unstructured":"S. Fiorini and A. Herinckx: A tighter Erd\u0151s\u2013P\u00f3sa function for long cycles, J. Graph Theory 77 (2014), 111\u2013116.","journal-title":"J. Graph Theory"},{"key":"3669_CR9","unstructured":"T. Huynh, F. Joos and P. Wollan: A unified Erd\u0151s-P\u00f3sa theorem for constrained cycles, to appear in Combinatorica."},{"key":"3669_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.jctb.2011.03.004","volume":"101","author":"N. Kakimura","year":"2011","unstructured":"N. Kakimura, K. Kawarabayashi and D. Marx: Packing cycles through prescribed vertices, J. Combin. Theory (Series B) 101 (2011), 378\u2013381.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3669_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jctb.2015.12.002","volume":"119","author":"K. Kawarabayashi","year":"2016","unstructured":"K. Kawarabayashi and Y. Kobayashi: Edge-disjoint odd cycles in 4-edge-connected graphs, J. Combin. Theory (Series B) 119 (2016), 12\u201327.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3669_CR12","unstructured":"C.-H. Liu: Packing and Covering immersions in 4-Edge-Connected Graphs, arXiv:1505.00867 (2015)."},{"key":"3669_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jctb.2017.01.004","volume":"125","author":"F. Mousset","year":"2017","unstructured":"F. Mousset, A. Noever, N. \u0160kori\u0107 and F. Weissenberger: A tight Erd\u0151s-P\u00f3sa function for long cycles, J. Combin. Theory (Series B), 125 (2017), 21\u201332.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3669_CR14","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.jctb.2012.05.004","volume":"102","author":"M. Pontecorvi","year":"2012","unstructured":"M. Pontecorvi and P. Wollan: Disjoint cycles intersecting a set of vertices, J. Combin. Theory (Series B) 102 (2012), 1134\u20131141.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3669_CR15","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1016\/j.disc.2016.03.004","volume":"339","author":"J.-F. Raymond","year":"2016","unstructured":"J.-F. Raymond, I. Sau and D. M. Thilikos: An edge variant of the Erd\u0151s\u2013P\u00f3sa property, Discrete Math. 339 (2016), 2027\u20132035.","journal-title":"Discrete Math."},{"key":"3669_CR16","unstructured":"J.-F. Raymond and D. Thilikos: Recent techniques and results on the Erd\u0151s\u2013P\u00f3sa property, to appear in Disc. App. Math."},{"key":"3669_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour: Graph minors. V. Excluding a planar graph, J. Combin. Theory (Series B) 41 (1986), 92\u2013114.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3669_CR18","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1112\/jlms\/s1-28.1.104","volume":"28","author":"K. F. Roth","year":"1953","unstructured":"K. F. Roth: On certain sets of integers, J. London Math. Soc. 28 (1953), 104\u2013109.","journal-title":"J. London Math. Soc."},{"key":"3669_CR19","first-page":"939","volume-title":"Triple systems with no six points carrying three triangles, Combinatorics","author":"I. Z. Ruzsa","year":"1978","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di: Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 18, North-Holland, Amsterdam-New York, 1978, pp. 939\u2013945."},{"key":"3669_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02020974","volume":"18","author":"M. Simonovits","year":"1967","unstructured":"M. Simonovits: A new proof and generalizations of a theorem of Erd\u0151s and P\u00f3sa on graphs without k+1 independent circuits, Acta Math. Acad. Sci. Hungar. 18 (1967), 191\u2013206.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"3669_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"C. Thomassen: On the presence of disjoint subgraphs of a specified type, J. Graph Theory 12 (1988), 101\u2013111.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3669-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3669-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3669-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T17:46:57Z","timestamp":1693676817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3669-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["3669"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3669-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,17]]},"assertion":[{"value":"22 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}