{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:47Z","timestamp":1759637807669,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In the game of Cops and Robbers, the capture time of a graph is the minimum number of moves needed by the cops to\u00a0capture the robber, assuming optimal play. We prove that the capture time of the $n$-dimensional hypercube is $\\Theta (n\\ln n)$. Our methods\u00a0include a novel randomized strategy for the players, which involves the analysis of the coupon-collector problem.<\/jats:p>","DOI":"10.37236\/2921","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:12:52Z","timestamp":1578719572000},"source":"Crossref","is-referenced-by-count":7,"title":["The Capture Time of the Hypercube"],"prefix":"10.37236","volume":"20","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Gordinowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Kinnersley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2013,4,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p24\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p24\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:20:53Z","timestamp":1579260053000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,30]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/2921","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,4,30]]},"article-number":"P24"}}