{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:56:09Z","timestamp":1787507769431,"version":"build-2736575974"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We consider a variant of the Cops and Robbers game where the robber can move $s$ edges at a time, and show that in this variant, the cop number of a connected graph on $n$ vertices can be as large as $\\Omega(n^\\frac{s}{s+1})$.  This improves the $\\Omega(n^{\\frac{s-3}{s-2}})$ lower bound of Frieze et al., and extends the result of the second author, which establishes the above bound for $s=2,4$.<\/jats:p>","DOI":"10.37236\/506","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:57:00Z","timestamp":1578697020000},"source":"Crossref","is-referenced-by-count":10,"title":["On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game"],"prefix":"10.37236","volume":"18","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abbas","family":"Mehrabian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2011,1,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p19\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:17:51Z","timestamp":1579285071000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,19]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/506","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,19]]},"article-number":"P19"}}