{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:45:00Z","timestamp":1787319900021,"version":"build-2736575974"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["PD 109537"],"award-info":[{"award-number":["PD 109537"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["K 116769"],"award-info":[{"award-number":["K 116769"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["PD 108406"],"award-info":[{"award-number":["PD 108406"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["K 116769"],"award-info":[{"award-number":["K 116769"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["SNN 116095"],"award-info":[{"award-number":["SNN 116095"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100008524","name":"University of Montana","doi-asserted-by":"publisher","award":["M25364"],"award-info":[{"award-number":["M25364"]}],"id":[{"id":"10.13039\/100008524","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Let $L$ be a set of positive integers. We call a (directed) graph $G$ an $L$ -cycle graph if all cycle lengths in $G$ belong to $L$. Let $c(L,n)$ be the maximum number of cycles possible in an $n$-vertex $L$-cycle graph (we use $\\vec{c}(L,n)$ for the number of cycles in directed graphs). In the undirected case we show that for any fixed set $L$, we have $c(L,n)=\\Theta(n^{\\lfloor k\/\\ell \\rfloor})$, where $k$ is the largest element of $L$ and $2\\ell$ is the smallest even element of $L$ (if $L$ contains only odd elements, then $c(L,n)=\\Theta(n)$ holds). We also give a characterization of $L$-cycle graphs when $L$ is a single element. In the directed case we prove that for any fixed set $L$, we have $\\vec{c}(L,n)=(1+o(1))(\\frac{n-1}{k-1})^{k-1}$, where $k$ is the largest element of $L$. We determine the exact value of $\\vec{c}(\\{k\\},n)$ for every $k$ and characterize all graphs attaining this maximum.<\/jats:p>","DOI":"10.1137\/16m109898x","type":"journal-article","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:24:31Z","timestamp":1517311471000},"page":"266-279","source":"Crossref","is-referenced-by-count":6,"title":["On the Number of Cycles in a Graph with Restricted Cycle Lengths"],"prefix":"10.1137","volume":"32","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cory","family":"Palmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Patk\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,30]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.03.004"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.016"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90052-5"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"R. Diestel,\n                      Graph Theory\n                      , 4th ed., Graduate Texts in Mathematics 173, Springer, Heidelberg, 2010,https:\/\/doi.org\/10.1007\/978-3-642-14279-6.","DOI":"10.1007\/978-3-642-14279-6"},{"key":"atypb5","unstructured":"P. Erdo\u0308s,\n                      On Some Problems in Graph Theory, Combinatorial Analysis and Combinatorial Number Theory\n                      , Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, 1984, pp. 1-17."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.04.001"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122689"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.12.008"},{"key":"atypb9","first-page":"N5","volume":"12","author":"Lam T.","year":"2005","journal-title":"J. Comb."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M109898X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:50Z","timestamp":1787316830000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M109898X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M109898X"],"URL":"https:\/\/doi.org\/10.1137\/16m109898x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}