{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T12:24:57Z","timestamp":1753359897355},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T00:00:00Z","timestamp":1352246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1225-4","type":"journal-article","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T07:17:48Z","timestamp":1352186268000},"page":"1927-1942","source":"Crossref","is-referenced-by-count":3,"title":["A Tur\u00e1n-Type Problem on Distances in Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Mykhaylo","family":"Tyomkyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Uzzell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,7]]},"reference":[{"key":"1225_CR1","doi-asserted-by":"crossref","first-page":"808","DOI":"10.2307\/2974509","volume":"102","author":"M. Aigner","year":"1995","unstructured":"Aigner M.: Tur\u00e1n\u2019s graph theorem. Am. Math. Monthly 102, 808\u2013816 (1995)","journal-title":"Am. Math. Monthly"},{"key":"1225_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R. Ahlswede","year":"1978","unstructured":"Ahlswede R., Katona G.O.H.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hungar 32, 97\u2013120 (1978)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"1225_CR3","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF02761855","volume":"38","author":"N. Alon","year":"1981","unstructured":"Alon N.: On the number of subgraphs of prescribed type of graphs with a given number of edges. Israel J. Math. 38, 116\u2013130 (1981)","journal-title":"Israel J. Math."},{"key":"1225_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02772673","volume":"53","author":"N. Alon","year":"1986","unstructured":"Alon N.: On the number of certain subgraphs contained in graphs with a given number of edges. Israel J. Math. 53, 97\u2013120 (1986)","journal-title":"Israel J. Math."},{"key":"1225_CR5","first-page":"225","volume":"50","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B., Erd\u0151s P.: Graphs of extremal weights. Ars. Combin. 50, 225\u2013233 (1998)","journal-title":"Ars. Combin."},{"key":"1225_CR6","first-page":"115","volume":"38","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B., Sarkar A.: Paths in graphs. Stud. Sci. Math. Hungar 38, 115\u2013137 (2001)","journal-title":"Stud. Sci. Math. Hungar"},{"key":"1225_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0012-365X(02)00878-6","volume":"265","author":"B. Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s B., Sarkar A.: Paths of length four. Discrete Math. 265, 357\u2013363 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"1225_CR8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1002\/jgt.20600","volume":"70","author":"B. Bollob\u00e1s","year":"2012","unstructured":"Bollob\u00e1s B., Tyomkyn M.: Walks and paths in trees. J. Graph Theory 70(1), 54\u201366 (2012)","journal-title":"J. Graph Theory"},{"key":"1225_CR9","first-page":"73","volume":"61","author":"O.D. Byer","year":"2001","unstructured":"Byer O.D.: Maximum number of 3-paths in a graph. Ars. Combin. 61, 73\u201379 (2001)","journal-title":"Ars. Combin."},{"issue":"2","key":"1225_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00493-010-2516-0","volume":"30","author":"P. Csikv\u00e1ri","year":"2010","unstructured":"Csikv\u00e1ri P.: On a poset of trees. Combinatorica 30(2), 125\u2013137 (2010)","journal-title":"Combinatorica"},{"key":"1225_CR11","first-page":"403","volume":"27","author":"Z. F\u00fcredi","year":"1992","unstructured":"F\u00fcredi Z.: Graphs with maximum number of star-forests. Stud. Sci. Math. Hungar 27, 403\u2013407 (1992)","journal-title":"Stud. Sci. Math. Hungar"},{"key":"1225_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02771620","volume":"9","author":"M. Katz","year":"1971","unstructured":"Katz M.: Rearrangements of (0\u20131) matrices. Israel J. Math. 9, 53\u201371 (1971)","journal-title":"Israel J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1225-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1225-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1225-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1225-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,7]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1225"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1225-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,7]]}}}