A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In the (G,H)-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either G or H, whose aim is to convince the verifier that two graphs G and H are isomorphic. In recent work along with Atserias, Šámal and Severini [Journal of Combinatorial Theory, Series B, 136:89–328, 2019] we showed that a verifier can be convinced that two non-isomorphic graphs are isomorphic, if the provers are allowed to sharearXiv:2004.10893v1 fatcat:wnophwxi5jbhbcf4msnn56co3u