{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:28Z","timestamp":1753893868966,"version":"3.41.2"},"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>In a strong game played on the edge set of a graph $G$ there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of $G$ (with Red playing first). The winner is the first one to claim all the edges of some target structure (such as a clique $K_k$, a perfect matching, a Hamilton cycle, etc.). In this paper we consider strong games played on the edge set of a random graph $G\\sim G(n,p)$ on $n$ vertices. We prove that $G\\sim G(n,p)$ is typically such that Red can win the perfect matching game played on $E(G)$, provided that $p\\in(0,1)$ is a fixed constant.\u00a0<\/jats:p>","DOI":"10.37236\/5414","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:23:42Z","timestamp":1578684222000},"source":"Crossref","is-referenced-by-count":0,"title":["Strong Games Played on Random Graphs"],"prefix":"10.37236","volume":"24","author":[{"given":"Asaf","family":"Ferber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Pfister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2017,2,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p35\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p35\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:05:28Z","timestamp":1579237528000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/5414","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,17]]},"article-number":"P1.35"}}