{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T18:47:44Z","timestamp":1771354064280,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1901-0","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T06:18:43Z","timestamp":1526019523000},"page":"633-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Erd\u0151s\u2013Gallai-Type Theorem for Keyrings"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1755-4013","authenticated-orcid":false,"given":"Alexander","family":"Sidorenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"key":"1901_CR1","unstructured":"Ajtai, M., Koml\u00f3s, J., Simonovits, M., Szemer\u00e9di, E.: On the approximative solution of the Erd\u0151s\u2013S\u00f3s conjecture on trees (manuscript)"},{"key":"1901_CR2","unstructured":"Ajtai, M., Koml\u00f3s, J., Simonovits, M., Szemer\u00e9di, E.: Some elementary lemmas on the Erd\u0151s\u2013S\u00f3s conjecture for trees (manuscript)"},{"key":"1901_CR3","unstructured":"Ajtai, M., Koml\u00f3s, J., Simonovits, M., Szemer\u00e9di, E.: The solution of the Erd\u0151s\u2013S\u00f3s conjecture for large trees (manuscript)"},{"key":"1901_CR4","first-page":"29","volume-title":"Theory of Graphs and its Applications","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, pp. 29\u201336. Academic Press, Cambridge (1965)"},{"key":"1901_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1901_CR6","doi-asserted-by":"publisher","first-page":"3055","DOI":"10.1016\/j.disc.2007.03.018","volume":"307","author":"G Fan","year":"2007","unstructured":"Fan, G., Sun, L.: The Erd\u0151s\u2013S\u00f3s conjecture for spiders. Discrete Math. 307, 3055\u20133062 (2007)","journal-title":"Discrete Math."},{"key":"1901_CR7","unstructured":"Fan, G., Hong, Y., Liu, Q.: The Erd\u0151s\u2013S\u00f3s conjecture for spiders. \n                    https:\/\/arxiv.org\/pdf\/1804.06567.pdf\n                    \n                   (2018). Accessed 19 Apr 2018"},{"key":"1901_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0095-8956(75)90080-5","volume":"19","author":"RJ Faudree","year":"1975","unstructured":"Faudree, R.J., Schelp, R.H.: Path Ramsey numbers in multicolorings. J. Combin. Theory B 19, 150\u2013160 (1975)","journal-title":"J. Combin. Theory B"},{"key":"1901_CR9","unstructured":"Kalai, G.: Micha Perles geometric proof of the Erd\u0151s\u2013S\u00f3s conjecture for caterpillars. \n                    https:\/\/gilkalai.wordpress.com\/2017\/08\/29\/micha-perles-geometric-proof-of-the-erdos-sos-conjecture-for-caterpillars\/\n                    \n                   (2017). Accessed 19 Apr 2018"},{"key":"1901_CR10","unstructured":"Kopylov, G.N.: Maximal paths and cycles in a graph. Dokl. Akad. Nauk SSSR 234, 19\u201321 (1977) (English translation: Soviet Math. Dokl. 18 593\u2013596 (1977))"},{"key":"1901_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/jgt.20083","volume":"49","author":"A McLennan","year":"2005","unstructured":"McLennan, A.: The Erd\u0151s\u2013S\u00f3s conjecture for trees of diameter four. J. Graph Theory 49, 291\u2013301 (2005)","journal-title":"J. Graph Theory"},{"key":"1901_CR12","first-page":"281","volume-title":"New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics","author":"W Moser","year":"1993","unstructured":"Moser, W., Pach, J.: Recent developments in combinatorial geometry. In: Pach, J. (ed.) New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, vol. 10, pp. 281\u2013302. Springer, Berlin (1993)"},{"key":"1901_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02124681","volume":"9","author":"A Sidorenko","year":"1989","unstructured":"Sidorenko, A.: Asymptotic solution for a new class of forbidden \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -graphs. Combinatorica 9, 207\u2013215 (1989)","journal-title":"Combinatorica"},{"key":"1901_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<229::AID-JGT13>3.0.CO;2-E","volume":"21","author":"M Wo\u017aniak","year":"1996","unstructured":"Wo\u017aniak, M.: On the Erd\u0151s\u2013S\u00f3s conjecture. J. Graph Theory 21, 229\u2013234 (1996)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1901-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T19:39:19Z","timestamp":1557517159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1901-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1901"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1901-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"assertion":[{"value":"22 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}