{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:44Z","timestamp":1753893824015,"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>Jigsaw percolation is a model for the process of solving puzzles\u00a0within a social network, which was recently proposed by Brummitt,\u00a0Chatterjee, Dey and Sivakoff. In the model there are two graphs on a\u00a0single vertex set (the `people' graph and the `puzzle' graph), and\u00a0vertices merge to form components if they are joined by an edge of\u00a0each graph. These components then merge to form larger components if\u00a0again there is an edge of each graph joining them, and so on.\u00a0Percolation is said to occur if the process terminates with a single\u00a0component containing every vertex. In this note we determine the\u00a0threshold for percolation up to a constant factor, in the case where\u00a0both graphs are Erd\u0151s-R\u00e9nyi random graphs.<\/jats:p>","DOI":"10.37236\/6102","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:54:27Z","timestamp":1578653667000},"source":"Crossref","is-referenced-by-count":4,"title":["The Threshold for Jigsaw Percolation on Random Graphs"],"prefix":"10.37236","volume":"24","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Riordan","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Slivken","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Smith","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,6,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i2p36\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i2p36\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:56:20Z","timestamp":1579218980000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i2p36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,16]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/6102","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,6,16]]},"article-number":"P2.36"}}